The following pages link to Leonidas J. Guibas (Q534491):
Displaying 23 items.
- Euclidean skeletons using closest points (Q534492) (← links)
- Scalar field analysis over point cloud data (Q650107) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- Efficient collision detection among moving spheres with unknown trajectories (Q818668) (← links)
- Learning smooth shapes by probing (Q871061) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Reconstruction using witness complexes (Q958231) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Reporting red-blue intersections between two sets of connected ine segments (Q1566372) (← links)
- Morphing simple polygons (Q1577545) (← links)
- Lower bounds for kinetic planar subdivisions (Q1591059) (← links)
- A hierarchical method for real-time distance computation among moving convex bodies (Q1974624) (← links)
- A package for exact kinetic data structures and sweepline algorithms (Q2371341) (← links)
- Optimal Point Location in a Monotone Subdivision (Q3738618) (← links)
- PERSISTENCE BARCODES FOR SHAPES (Q5468972) (← links)
- Manifold reconstruction in arbitrary dimensions using witness complexes (Q5902136) (← links)
- Kinetic connectivity for unit disks (Q5939471) (← links)
- Maintaining the extent of a moving point set (Q5953076) (← links)
- Geodesic Delaunay triangulations in bounded planar domains (Q6486952) (← links)
