Binary space partitioning trees as an alternative representation of polytopes
DOI10.1016/0010-4485(90)90055-HzbMATH Open0728.68134OpenAlexW1970189162MaRDI QIDQ805288FDOQ805288
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
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
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cited In (6)
- Title not available (Why is that?)
- An efficient representation of general qualitative spatial information using bintrees
- DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING
- Title not available (Why is that?)
- DIMENSION-INDEPENDENT BSP (1): SECTION AND INTERIOR-TO-BOUNDARY MAPPING
- PARALLEL SOLID MODELING USING BSP DATAFLOW
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)
