| A fast algorithm for computing irreducible triangulations of closed surfaces in 𝔼d. | 0 | 0.34 | 2018 |
| Minimal forcing sets for 1D origami. | 0 | 0.34 | 2017 |
| Distributed reconfiguration of 2D lattice-based modular robotic systems | 6 | 0.43 | 2015 |
| A fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$. | 0 | 0.34 | 2014 |
| Quadrilateral meshes with provable angle bounds | 3 | 0.44 | 2012 |
| Efficient constant-velocity reconfiguration of crystalline robots** | 2 | 0.36 | 2011 |
| Quadrilateral meshes with bounded minimum angle | 10 | 0.76 | 2009 |
| Realistic Reconfiguration of Crystalline (and Telecube) Robots | 5 | 0.51 | 2008 |
| Quadrilateral Meshes With Bounded Minimum Angle | 0 | 0.34 | 2008 |
| Linear reconfiguration of cube-style modular robots | 11 | 0.86 | 2007 |
| Efficient Many-To-Many Point Matching in One Dimension. | 5 | 0.50 | 2007 |
| A New Lower Bound on Guard Placement for Wireless Localization | 6 | 0.87 | 2007 |
| Connecting Polygonizations via Stretches and Twangs | 3 | 0.45 | 2007 |
| Curves in the Sand: Algorithmic Drawing | 1 | 0.45 | 2006 |
| An O(n log n)-time algorithm for the restriction scaffold assignment problem. | 8 | 0.54 | 2006 |
| An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment | 0 | 0.34 | 2005 |
| Games on triangulations | 1 | 0.54 | 2005 |
| Constrained Quadrilateral Meshes Of Bounded Size | 5 | 0.56 | 2005 |
| Small Strictly Convex Quadrilateral Meshes of Point Sets. | 0 | 0.34 | 2004 |
| Efficient computation of location depth contours by methods of computational geometry | 16 | 0.98 | 2003 |
| A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration | 1 | 0.36 | 2003 |
| Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane | 0 | 0.34 | 2002 |
| On Computing General Position Views of Data in Three Dimensions | 4 | 0.51 | 2002 |
| Small Strictly Convex Quadrilateral Meshes of PointSets | 5 | 0.49 | 2002 |
| Experimental results on quadrangulations of sets of fixed points | 4 | 0.46 | 2002 |
| Implicit Convex Polygons | 2 | 0.40 | 2002 |
| Fast implementation of depth contours using topological sweep | 14 | 2.09 | 2001 |
| Efficient approximation algorithms for tiling and packing problems with rectangles | 30 | 1.30 | 2001 |
| Small Convex Quadrangulations of Point Sets | 4 | 0.55 | 2001 |
| Improved approximation algorithms for rectangle tiling and packing | 15 | 0.89 | 2001 |
| Flipturning polygons | 3 | 0.66 | 2000 |
| Converting triangulations to quadrangulations | 29 | 1.75 | 1998 |
| Finding Specified Sections of Arrangements: 2D Results | 0 | 0.34 | 1998 |
| Parallel Randomized Techniques for Some Fundamental Geometric Problems: A Survey | 0 | 0.34 | 1998 |
| Computing Constrained Minimum-Width Annuli of Point Sets | 23 | 1.26 | 1997 |
| On Removing Non-degeneracy Assumptions in Computational Geometry | 4 | 0.90 | 1997 |
| Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane | 1 | 0.37 | 1995 |
| Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems | 7 | 0.55 | 1994 |
