Linear size binary space partitions for fat objects
Author:
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 252-263
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Computing and Verifying Depth OrdersSIAM Journal on Computing, 1994
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- Computing depth orders and related problemsLecture Notes in Computer Science, 1994
- On the union of fat wedges and separating a collection of segments by a lineComputational Geometry, 1993
- On fat partitioning, fat covering and the union size of polygonsLecture Notes in Computer Science, 1993
- Point location in fat subdivisionsInformation Processing Letters, 1992
- Efficient binary space partitions for hidden-surface removal and solid modelingDiscrete & Computational Geometry, 1990
- Merging BSP trees yields polyhedral set operationsACM SIGGRAPH Computer Graphics, 1990
- Near real-time shadow generation using BSP trees1989
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980