Tetrahedralization of two nested convex polyhedra

DOI10.1007/3-540-44968-X_29MaRDI QIDQ2766838zbMATH OpenFDO

Authors Cao An Wang, Boting Yang

Publication date 1 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_29

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
• scientific article; zbMATH DE number 741009
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• Finding minimal convex nested polygons
• Tetrahedrizing point sets in three dimensions

Cited in

(6)

• Two tetrahedral \(C^1\) cubic macro elements
• Hamiltonian tetrahedralizations with Steiner points
• Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
• Are all convex polyhedra tetragonalizable?
• Degenerate tetrahedra removal
• scientific article; zbMATH DE number 741009 (Why is no real title available?)

This page was built for publication: Tetrahedralization of two nested convex polyhedra

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