Bounded-degree polyhedronization of point sets

DOI10.1016/j.comgeo.2012.02.008zbMath1257.51009OpenAlexW2179787197MaRDI QIDQ691768

Erik D. Demaine, André Schulz, David Charlton, Mashhood Ishaque, Diane L. Souvaine, Andrew Winslow, Nadia Benbernou, Godfried T. Toussaint, Gill Barequet, Martin L. Demaine, Anna Lubiw

Publication date: 4 December 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.02.008

zbMATH Keywords

convex hullrandomized algorithmgift wrappingserpentineserpentine polyhedronizationtetrahedralization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (3) dimensions (including convex surfaces) (52A15) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items

Circumscribing polygons and polygonizations for disjoint line segments ⋮ Unnamed Item

Cites Work

• Fast detection of polyhedral intersection
• Dynamic half-space range reporting and its applications
• On polyhedra induced by point sets in space
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries