Binary space partitioning trees as an alternative representation of polytopes

DOI10.1016/0010-4485(90)90055-HMaRDI QIDQ805288zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0010-4485(90)90055-h

zbMATH Keywords

polyhedrageometric modellingset operationsBinary Space Partitioning Trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 1163560
• Binary partitions and binary partition polytopes
• Hyper-rectangular space partitioning trees: practical approach
• Representing partitions on trees
• Multi-way space partitioning trees.
• \(b\)-tree facets for the simple graph partitioning polytope
• Convex tree realizations of partitions
• The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
• Compact embedding of binary trees into hypercubes
• Bipartite embeddings of trees in the plane

Cited in

(6)

• PARALLEL SOLID MODELING USING BSP DATAFLOW
• scientific article; zbMATH DE number 4180836 (Why is no real title available?)
• An efficient representation of general qualitative spatial information using bintrees
• DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING
• scientific article; zbMATH DE number 1163560 (Why is no real title available?)
• DIMENSION-INDEPENDENT BSP (1): SECTION AND INTERIOR-TO-BOUNDARY MAPPING

This page was built for publication: Binary space partitioning trees as an alternative representation of polytopes

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