Algorithms and complexity for tetrahedralization detections

DOI10.1007/3-540-36136-7_27MaRDI QIDQ4425964zbMATH OpenFDO

Authors Boting Yang, Cao An Wang, Francis Y. L. Chin

Publication date 14 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180296.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Detecting tetrahedralizations of a set of line segments
• Tetrahedrizing point sets in three dimensions
• On triangulating three-dimensional polygons
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Hamiltonian tetrahedralizations with Steiner points

Cited in

(1)

• Detecting tetrahedralizations of a set of line segments

This page was built for publication: Algorithms and complexity for tetrahedralization detections

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