Convex polyhedral chains: A representation for geometric data
From MaRDI portal
Recommendations
- THE EXTENDED CONVEX DIFFERENCES TREE (ECDT) REPRESENTATION FOR N-DIMENSIONAL POLYHEDRA
- scientific article; zbMATH DE number 4110185
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- scientific article; zbMATH DE number 1303061
- Efficient structures for geometric data management
Cited in
(3)
This page was built for publication: Convex polyhedral chains: A representation for geometric data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118964)