Binary space partitioning trees as an alternative representation of polytopes

DOI10.1016/0010-4485(90)90055-HzbMath0728.68134OpenAlexW1970189162MaRDI QIDQ805288

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

polyhedraset operationsgeometric modellingBinary Space Partitioning Trees

Mathematics Subject Classification ID

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

Related Items (3)

DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING ⋮ PARALLEL SOLID MODELING USING BSP DATAFLOW ⋮ 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