Bounded-degree polyhedronization of point sets

DOI10.1016/J.COMGEO.2012.02.008MaRDI QIDQ691768zbMATH OpenOpenAlexFDO

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

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

randomized algorithmconvex hullgift wrappingserpentineserpentine polyhedronizationtetrahedralization

Mathematics Subject Classification ID

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

Recommendations

• On polyhedra induced by point sets in space
• Tetrahedrizing point sets in three dimensions
• Reconstructing orthogonal polyhedra from putative vertex sets
• A tight bound for the Delaunay triangulation of points on a polyhedron
• Hamiltonian tetrahedralizations with Steiner points

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 2080989 (Why is no real title available?)
• Description of polygonal regions by polynomials of bounded degree
• On polyhedra induced by point sets in space
• Circumscribing polygons and polygonizations for disjoint line segments
• Bounded remainder polyhedra
• scientific article; zbMATH DE number 7559209 (Why is no real title available?)

This page was built for publication: Bounded-degree polyhedronization of point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691768)