Suneeta Ramaswami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Suneeta Ramaswami has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Mirela Damian
Villanova University
6 shared publications - Robin Flatland
Siena College, Loudonville, NY, USA
5 shared publications - Vera Sacristán
Universitat Politecnica de Catalunya, Barcelona, Spain
4 shared publications - Erik D. Demaine
Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA
3 shared publications - Joseph O'Rourke
Smith College
3 shared publications - Stefan Langerman
Computer Science Department Université Libre de Bruxelles Belgium
3 shared publications
Latest Publications
- 1 March 2018
- Published by Elsevier in Computational Geometry
- Vol. 68, 327-357
A fast algorithm for computing irreducible triangulations of closed surfaces in- 1 March 2018
- Published by Elsevier in Computational Geometry
- Vol. 68, 327-357
A fast algorithm for computing irreducible triangulations of closed surfaces in- Open Access
Minimal forcing sets for 1D origami
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.
Open AccessMinimal forcing sets for 1D origami
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.
- 17 January 2015
- Published by Springer Nature in Autonomous Robots
- Vol. 38 (4) , 383-413
Distributed reconfiguration of 2D lattice-based modular robotic systems
- 17 January 2015
- Published by Springer Nature in Autonomous Robots
- Vol. 38 (4) , 383-413
Distributed reconfiguration of 2D lattice-based modular robotic systems
- Open AccessA fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our algorithm takes $O(g^2+gn)$ time to obtain $T^\prime$, where $n$ is the number of triangles of $T$. Otherwise, $T^\prime$ is obtained in linear time in $n$. While the latter upper bound is optimal, the former upper bound improves upon the currently best known upper bound by a $(\lg n / g)$ factor. In both cases, the memory space required by our algorithm is in ${\Theta}(n)$.Open AccessA fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our algorithm takes $O(g^2+gn)$ time to obtain $T^\prime$, where $n$ is the number of triangles of $T$. Otherwise, $T^\prime$ is obtained in linear time in $n$. While the latter upper bound is optimal, the former upper bound improves upon the currently best known upper bound by a $(\lg n / g)$ factor. In both cases, the memory space required by our algorithm is in ${\Theta}(n)$.
- 21 April 2011
- Published by Springer Nature in Engineering with Computers
- Vol. 28 (1) , 31-56
Quadrilateral meshes with provable angle bounds
- 21 April 2011
- Published by Springer Nature in Engineering with Computers
- Vol. 28 (1) , 31-56
Quadrilateral meshes with provable angle bounds
- Open Access
- 14 January 2011
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 29 (1) , 59-71
Efficient constant-velocity reconfiguration of crystalline robots
SUMMARY: In this paper, we propose novel algorithms for reconfiguring modular robots that are composed ofnatoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2 × 2 × 2 modules. We respect certain physical constraints: each atom reaches at most constant velocity and can displace at most a constant number of other atoms. We assume that one of the atoms has access to the coordinates of atoms in the target configuration.Our algorithms involve a total ofO(n2) atom operations, which are performed inO(n) parallel steps. This improves on previous reconfiguration algorithms, which either useO(n2) parallel steps or do not respect the constraints mentioned above. In fact, in the settings considered, our algorithms are optimal. A further advantage of our algorithms is that reconfiguration can take place within the union of the source and target configuration space, and only requires local communication.
- 14 January 2011
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 29 (1) , 59-71
Open AccessEfficient constant-velocity reconfiguration of crystalline robots
SUMMARY: In this paper, we propose novel algorithms for reconfiguring modular robots that are composed ofnatoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2 × 2 × 2 modules. We respect certain physical constraints: each atom reaches at most constant velocity and can displace at most a constant number of other atoms. We assume that one of the atoms has access to the coordinates of atoms in the target configuration.Our algorithms involve a total ofO(n2) atom operations, which are performed inO(n) parallel steps. This improves on previous reconfiguration algorithms, which either useO(n2) parallel steps or do not respect the constraints mentioned above. In fact, in the settings considered, our algorithms are optimal. A further advantage of our algorithms is that reconfiguration can take place within the union of the source and target configuration space, and only requires local communication.
- Open Access
- 1 January 2009
- Published by Springer Nature
- p. 433-447
Realistic Reconfiguration of Crystalline (and Telecube) Robots
- 1 January 2009
- Published by Springer Nature
- p. 433-447
Open AccessRealistic Reconfiguration of Crystalline (and Telecube) Robots
- Open Access
A New Lower Bound on Guard Placement for Wireless Localization
The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a given polygonal region. The primary goal is to minimize the number of stations. In this paper we establish a lower bound of 2n/3 - 1 stations for polygons in general position, for the case in which the placement of stations is restricted to polygon vertices, improving upon the existing n/2 lower bound.
Open AccessA New Lower Bound on Guard Placement for Wireless Localization
The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a given polygonal region. The primary goal is to minimize the number of stations. In this paper we establish a lower bound of 2n/3 - 1 stations for polygons in general position, for the case in which the placement of stations is restricted to polygon vertices, improving upon the existing n/2 lower bound.
- Open Access
Connecting Polygonizations via Stretches and Twangs
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n^2) ``moves'' between simple polygons. Each move is composed of a sequence of atomic moves called ``stretches'' and ``twangs''. These atomic moves walk between weakly simple ``polygonal wraps'' of S. These moves show promise to serve as a basis for generating random polygons.
Open AccessConnecting Polygonizations via Stretches and Twangs
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n^2) ``moves'' between simple polygons. Each move is composed of a sequence of atomic moves called ``stretches'' and ``twangs''. These atomic moves walk between weakly simple ``polygonal wraps'' of S. These moves show promise to serve as a basis for generating random polygons.