Convex polyhedral chains: A representation for geometric data

DOI10.1016/0010-4485(89)90070-5MaRDI QIDQ1118964zbMATH OpenOpenAlexWikidataFDO

Authors Eugene Wong, Oliver Günther

Publication date 1989

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4485(89)90070-5

zbMATH Keywords

polyhedradata managementconstructive solid geometrysolid modelling

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Algorithms for approximation of functions (65D15)

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)

• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
• From theoretical graphic objects to real free-form solids
• DIMENSION-INDEPENDENT BSP (1): SECTION AND INTERIOR-TO-BOUNDARY MAPPING

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)