Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions

David Eppstein and Jeffrey Gordon Erickson
Discrete & Computational Geometry 22(4):569–592, 1999
Proc. 14th Symp. Computational Geometry, ACM, Jun 1998, pp. 58–67
Mathematical Reviews 2000i:68185

Cited by:

• Computing extreme origami bases
• Folding and one straight cut suffice
• Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
• Folding and cutting paper
• Kinetic Data Structures
• Straight skeletons for general polygonal figures in the plane
• Deformable free space tilings for kinetic collision detection
• Kinetic collision detection between simple polygons
• Semi-online maintenance of geometric optima and measures
• Motorcycle graphs and straight skeletons
• Computational geometry - Some easy questions and their recent solutions
• Optimal polygon cover problems and applications
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Straight-skeleton based contour interpolation
• Polygon decomposition based on the straight line skeleton
• Straight line skeleton in linear time, topologically equivalent to the medial axis
• Proximity and Applications in General Metrics
• The iron laws of air traffic control
• Towards fully automatic generation of city models
• City models — automation in research and practice
• Automatische Gebäudeerfassung aus digitalen Oberflächenmodellen und Grundrissen
• Kinetic Maintenance of Proximity Structures
• Algorithmic problems on proximity and location under metric constraints
• A straight skeleton approximating the medial axis
• Hinged dissection of polypolyhedra