Stabbing Delaunay tetrahedralizations

DOI10.1007/S00454-004-1095-5MaRDI QIDQ705126zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Finding stabbing lines in 3-space
• Stabbing simplices by points and flats
• On the stabbing number of a random Delaunay triangulation
• On stabbing lines for convex polyhedra in 3D
• Lower bounds on stabbing lines in 3-space

Cited in

(4)

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

This page was built for publication: Stabbing Delaunay tetrahedralizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705126)