Optimal binary space partitions for orthogonal objects
Authors:
- Michael S PatersonMPMichael S Paterson
- F Frances YaoFYF Frances Yao
- 1 March 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (1) , 99-113
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Efficient binary space partitions for hidden-surface removal and solid modelingDiscrete & Computational Geometry, 1990
- Making data structures persistentJournal of Computer and System Sciences, 1989
- An efficient algorithm for finding the CSG representation of a simple polygonACM SIGGRAPH Computer Graphics, 1988
- Set operations on polyhedra using binary space partitioning treesACM SIGGRAPH Computer Graphics, 1987
- Priority Search TreesSIAM Journal on Computing, 1985
- New Data Structures for Orthogonal Range QueriesSIAM Journal on Computing, 1985
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980