Bounds on the size of tetrahedralizations

DOI10.1007/BF02570716zbMath0841.68119OpenAlexW2105775086MaRDI QIDQ1906047

N. Shouraboura, Bernard Chazelle

Publication date: 6 February 1996

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

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

zbMATH Keywords

convex polyhedracomplexity of triangulating

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon ⋮ A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ Efficiently hex-meshing things with topology ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ Strategies for polyhedral surface decomposition: an experimental study.

Cites Work

• Unnamed Item
• Unnamed Item
• Fast detection of polyhedral intersection
• Triangulating a nonconvex polytope
• Primitives for the manipulation of three-dimensional subdivisions
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Castles in the air revisited
• Triangles in space or building (and analyzing) castles in the air
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Convex Decomposition of Polyhedra and Robustness
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra

This page was built for publication: Bounds on the size of tetrahedralizations