Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Near real-time shadow generation using BSP trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
Fast object-precision shadow generation for area light sources using BSP trees
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Interactive solid geometry via partitioning trees
Proceedings of the conference on Graphics interface '92
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
New results on binary space partitions in the plane
Computational Geometry: Theory and Applications
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Kinetic vertical decomposition trees
Kinetic vertical decomposition trees
Kinetic KD-trees and longest-side KD-trees
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Kinetic collision detection for convex fat objects
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the twenty-fifth annual symposium on Computational geometry
Kinetic kd-Trees and Longest-Side kd-Trees
SIAM Journal on Computing
| Hi-index | 0.00 |
We present anew technique to maintain a BSP for a set of n moving disj oint segments in the plane. Our kinetic BSP uses O(n log n) storage and it undergoes O(n 2 ) changes in the worst case, assuming that the endpoints of the segments move along bounded-degree algebraically dened trajecto- ries. The response time (the time needed to update the BSP when it undergoes a change) is O(log 2 n). A random- ized variant achieves O(log n) expected response time, while the worst-case response time remains O(log 2 n).The new BSP is based on a simple technique for main- taining a 1-d segment tree on a set of intervals on the real line with moving endpoints. The response time of the ki- netic segment treeisO(log n) intheworst case, and O(1) expected.