Suneeta Ramaswami

According to our database1, Suneeta Ramaswami authored at least 38 papers between 1994 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A fast algorithm for computing irreducible triangulations of closed surfaces in 𝔼<sup>d</sup>.
Comput. Geom., 2018

2017
Minimal forcing sets for 1D origami.
CoRR, 2017

2015
Distributed reconfiguration of 2D lattice-based modular robotic systems.
Auton. Robots, 2015

2014
A fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$.
CoRR, 2014

2012
Quadrilateral meshes with provable angle bounds.
Eng. Comput., 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

2010
Connecting Polygonizations via Stretches and Twangs.
Theory Comput. Syst., 2010

2009
Linear reconfiguration of cube-style modular robots.
Comput. Geom., 2009

Quadrilateral meshes with bounded minimum angle.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Quadrilateral Meshes with Bounded Minimum Angle.
Proceedings of the 17th International Meshing Roundtable, 2008

2007
Efficient Many-To-Many Point Matching in One Dimension.
Graphs Comb., 2007

A New Lower Bound on Guard Placement for Wireless Localization
CoRR, 2007

2006
An <i>O</i>(<i>n</i> log <i>n</i>)-Time Algorithm for the Restriction Scaffold Assignment Problem.
J. Comput. Biol., 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Games on triangulations.
Theor. Comput. Sci., 2005

Constrained quadrilateral meshes of bounded size.
Int. J. Comput. Geom. Appl., 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR, 2005

2004
Small Strictly Convex Quadrilateral Meshes of Point Sets.
Algorithmica, 2004

2003
Efficient computation of location depth contours by methods of computational geometry.
Stat. Comput., 2003

A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration.
Proceedings of the 12th International Meshing Roundtable, 2003

2002
On Computing General Position Views of Data in Three Dimensions.
J. Vis. Commun. Image Represent., 2002

Implicit Convex Polygons.
J. Math. Model. Algorithms, 2002

Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms, 2002

Flipturning Polygons.
Discret. Comput. Geom., 2002

Experimental results on quadrangulations of sets of fixed points.
Comput. Aided Geom. Des., 2002

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane.
Algorithmica, 2002

Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.
J. Algorithms, 2001

Fast implementation of depth contours using topological sweep.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Improved approximation algorithms for rectangle tiling and packing.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Small Convex Quadrangulations of Point Sets.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998
Converting triangulations to quadrangulations.
Comput. Geom., 1998

Computing constrained minimum-width annuli of point sets.
Comput. Aided Des., 1998

Parallel Randomized Techniques for Some Fundamental Geometric Problems: A Survey.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997
On Removing Non-degeneracy Assumptions in Computational Geometry.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1995
Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane.
J. Parallel Distributed Comput., 1995

1994
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994


  Loading...