On polyhedra induced by point sets in space

DOI10.1016/j.dam.2007.08.033zbMath1127.52003OpenAlexW2107489311MaRDI QIDQ2462350

Godfried T. Toussaint, Joan Trias, Pankaj K. Agarwal, Ferran Hurtado

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.033

zbMATH Keywords

triangulationpolyhedracomputational geometry

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (3) dimensions (including convex surfaces) (52A15) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

Circumscribing polygons and polygonizations for disjoint line segments ⋮ Reconstructing orthogonal polyhedra from putative vertex sets ⋮ Spiral Serpentine Polygonization of a Planar Point Set ⋮ Bounded-degree polyhedronization of point sets ⋮ Unnamed Item

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Another efficient algorithm for convex hulls in two dimensions
• Computing bushy and thin triangulations
• A fast convex hull algorithm
• Onion polygonizations
• Dynamic half-space range reporting and its applications
• An efficient algorithm for determining the convex hull of a finite planar set
• A new linear algorithm for triangulating monotone polygons
• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• Connect-the-dots: A new heuristic
• Optimal Search in Planar Subdivisions
• Metric Spaces in Which Minimal Circuits Cannot Self-Intersect
• ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES
• On Some Properties of Shortest Hamiltonian Circuits
• On Finite Subsets of the Plane and Simple Closed Polygonal Paths
• More on Finite Subsets and Simple Closed Polygonal Paths
• On Indecomposable Polyhedra

This page was built for publication: On polyhedra induced by point sets in space