Stabbing Delaunay tetrahedralizations

DOI10.1007/s00454-004-1095-5zbMath1092.52007OpenAlexW2080207623MaRDI QIDQ705126

Jonathan Richard Shewchuk

Publication date: 25 January 2005

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

Full work available at URL: https://doi.org/10.1007/s00454-004-1095-5

zbMATH Keywords

Delaunay triangulation of \(n\) points in dimensional spaceoptimal stabbing lines

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (4)

Practical distribution-sensitive point location in triangulations ⋮ Computing convex quadrangulations ⋮ Minimizing the stabbing number of matchings, trees, and triangulations ⋮ Convex subdivisions with low stabbing numbers

This page was built for publication: Stabbing Delaunay tetrahedralizations