Algorithms for triangulating polyhedra into a small number of tetrahedra

MaRDI QIDQ3424580zbMATH OpenFDO

Authors Milica Stojanović

Publication date 2 March 2007

Full work available at URL https://eudml.org/doc/127154, http://www.emis.de/journals/MV/0512/1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cone triangulationgreedy peeling algorithmminimal triangulation of polyhedra

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• scientific article; zbMATH DE number 2123350
• Convex polyhedra with triangular faces and cone triangulation
• Minimal tetrahedralizations of a class of polyhedra
• scientific article; zbMATH DE number 5642599
• Approximation for minimum triangulations of simplicial convex 3-polytopes

Cited in

(9)

• Minimal tetrahedralizations of a class of polyhedra
• Flexible polyhedra modeled by the virtual element method in a discrete element context
• scientific article; zbMATH DE number 5642599 (Why is no real title available?)
• scientific article; zbMATH DE number 4024170 (Why is no real title available?)
• scientific article; zbMATH DE number 2123350 (Why is no real title available?)
• 2-toroids and their 3-triangulation
• Classifying simplicial dissections of convex polyhedra with symmetry
• Convex polyhedra with triangular faces and cone triangulation
• 3-triangulations of polyhedra and their connection graphs

This page was built for publication: Algorithms for triangulating polyhedra into a small number of tetrahedra

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