Efficient binary space partitions for hidden-surface removal and solid modeling
- 1 October 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (5) , 485-503
- https://doi.org/10.1007/bf02187806
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Binary partitions with applications to hidden surface removal and solid modellingPublished by Association for Computing Machinery (ACM) ,1989
- Output-sensitive hidden surface removalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- A New Approach to Planar Point LocationSIAM Journal on Computing, 1981
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980
- Variable-Length Binary EncodingsBell System Technical Journal, 1959