Computing Nice Projections of Convex Polyhedra

DOI10.1007/978-3-540-77891-2_11MaRDI QIDQ5452158zbMATH OpenOpenAlexFDO

Authors Md Ashraful Alam, Masud Hasan

Publication date 25 March 2008

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77891-2_11

zbMATH Keywords

Convex polyhedranice orthogonal projectionsviewsVoronoi diagram

Mathematics Subject Classification ID

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

Recommendations

• Computing nice projections of convex polyhedra
• Efficient view point selection for silhouettes of convex polyhedra
• scientific article; zbMATH DE number 4078149
• Finding optimal shadows of polytopes
• Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections

Cites work

• Finding optimal shadows of polytopes
• Mathematical Foundations of Computer Science 2004
• Voronoi diagrams on the sphere

Cited in

(5)

• Projection onto a polyhedron that exploits sparsity
• Computing nice projections of convex polyhedra
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• scientific article; zbMATH DE number 4078149 (Why is no real title available?)
• A big-M type method for the computation of projections onto polyhedrons

This page was built for publication: Computing Nice Projections of Convex Polyhedra

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