scientific article; zbMATH DE number 4205983

MaRDI QIDQ3355233zbMATH OpenFDO

Authors Chanderjit L. Bajaj, Tamal K. Dey

Publication date 1989

zbMATH Keywords

convex decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Convex Decomposition of Polyhedra and Robustness
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Triangulating a nonconvex polytope
• Decomposing the boundary of a nonconvex polyhedron
• Decomposing the boundary of a nonconvex polyhedron

Cited in

(11)

• Robust polygon modelling
• Polygon nesting and robustness
• Decomposing the boundary of a nonconvex polyhedron
• CP3: Robust, output-sensitive display of convex polyhedra in scanline mode
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Approximate convex decomposition of polyhedra and its applications
• ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS: A FIXED PRECISION APPROACH
• LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
• Strategies for polyhedral surface decomposition: an experimental study.
• Convex Decomposition of Polyhedra and Robustness
• Triangulating a nonconvex polytope

This page was built for publication:

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