Triangulating point sets in space

DOI10.1007/BF02187874zbMath0615.52007MaRDI QIDQ1820437

Hossam ElGindy, David Avis

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131013

zbMATH Keywords

algorithmtriangulationsplittersimplicial point set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)

Related Items

Splitting a configuration in a simplex, An optimal speed-up parallel algorithm for triangulating simplicial point sets in space, Tetrahedrizing point sets in three dimensions, Connecting colored point sets, Geometric algorithms for the minimum cost assignment problem, Illumination by floodlights, Hamiltonian tetrahedralizations with Steiner points, Unnamed Item, The number of Reidemeister moves needed for unknotting, On the difficulty of triangulating three-dimensional nonconvex polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Tetrahedrizing point sets in three dimensions
• Optimal Search in Planar Subdivisions
• Convex hulls of finite sets of points in two and three dimensions