Triangulating point sets in space
From MaRDI portal
Publication:1820437
DOI10.1007/BF02187874zbMATH Open0615.52007MaRDI QIDQ1820437FDOQ1820437
Authors: 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
Recommendations
- On triangulations of the convex hull of n points
- Tetrahedrizing point sets in three dimensions
- Splitting a configuration in a simplex
- Construction of three-dimensional Delaunay triangulations using local transformations
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
Cited In (16)
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
- Good splitters for counting points in triangles
- Tetrahedrizing point sets in three dimensions
- Triangulations of Line Segment Sets in the Plane
- The point-location problem for three-dimensional space
- The number of Reidemeister moves needed for unknotting
- 2-toroids and their 3-triangulation
- Connecting colored point sets
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Splitting a configuration in a simplex
- Illumination by floodlights
- Finding simplices containing the origin in two and three dimensions
- Hamiltonian tetrahedralizations with Steiner points
- Geometric algorithms for the minimum cost assignment problem
- Triangulating input-constrained planar point sets
- On triangulations of the convex hull of n points
This page was built for publication: Triangulating point sets in space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820437)
