Conversion of binary space partitioning trees to boundary representation

MaRDI QIDQ4395133zbMATH OpenFDO

Authors João L. D. Comba, Bruce Naylor

Publication date 19 October 1998

zbMATH Keywords

binary space partitioning trees

Mathematics Subject Classification ID

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

Recommendations

• Binary space partitioning trees as an alternative representation of polytopes
• An optimal boundary to quadtree conversion algorithm
• Hyper-rectangular space partitioning trees: practical approach
• Representing partitions on trees
• Boundary of complete binary trees
• Partitioning technique for transforming perfect binary trees into single-row networks
• Partitioning bispanning graphs into spanning trees
• Partitioning bispanning graphs into spanning trees

Cited in

(4)

• Conversion of spatial-enumeration scheme into constructive solid geometry
• DIMENSION-INDEPENDENT BSP (1): SECTION AND INTERIOR-TO-BOUNDARY MAPPING
• DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING
• Binary space partitioning trees as an alternative representation of polytopes

This page was built for publication: Conversion of binary space partitioning trees to boundary representation

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