Triangulating point sets in space

DOI10.1007/BF02187874zbMATH Open0615.52007MaRDI QIDQ1820437FDOQ1820437

David Avis, Hossam ElGindy

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) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Search in Planar Subdivisions
• Convex hulls of finite sets of points in two and three dimensions
• Tetrahedrizing point sets in three dimensions

Cited In (14)

• 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
• Connecting colored point sets
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Splitting a configuration in a simplex
• Illumination by floodlights
• Hamiltonian tetrahedralizations with Steiner points
• Geometric algorithms for the minimum cost assignment problem
• Triangulating input-constrained planar point sets
• Title not available (Why is that?)

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)