Kinetic binary space partitions for intersecting segments and disjoint triangles

We describe randomized algorithms for e ciently maintaining a binary space partition of continuously moving, possibly intersecting, line segments in the plane, and of continuously moving but disjoint triangles in space. Our two-dimensional BSP has depth O(log n) and size O(n log n+ k) and can be constructed in expected O(n log n+ k log n) time, where k is the number of intersecting pairs. We can detect combinatorial changes to our BSP caused by the motion of the segments, and we can update our BSP in expectedO(log n) time per change. Our three-dimensional BSP has depth O(log n), size O(n log n+k), construction time O(n log n+k log n), and update time O(log n) (all expected), where k is the number of intersections between pairs of edges in the xyprojection of the triangles. Under reasonable assumptions about the motion of the segments or triangles, the expected number of number of combinatorial changes to either BSP is O(mn s(n)), where m is the number of moving objects and s(n) is the maximum length of an (n; s) Davenport-Schinzel sequence for some constant s.

[1]  R. Schmacher,et al.  Study for Applying Computer-Generated Images to Visual Simulation: (510842009-001) , 1969 .

[2]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[3]  T. Ottmann,et al.  Dynamical sets of points , 1984 .

[4]  M. Atallah.  Some dynamic computational geometry problems , 1985 .

[5]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[6]  Steven K. Feiner,et al.  Near real-time shadow generation using BSP trees , 1989, SIGGRAPH '89.

[7]  F. Frances Yao,et al.  Efficient binary space partitions for hidden-surface removal and solid modeling , 1990, Discret. Comput. Geom..

[8]  Enric Torres,et al.  Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes , 1990, Eurographics.

[9]  John Amanatides,et al.  Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.

[10]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

[11]  F. Frances Yao,et al.  Optimal binary space partitions for orthogonal objects , 1990, SODA '90.

[12]  Alade O. Tokuta.  Motion planning using binary space partitioning , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[13]  Simon Kahan,et al.  A model for data in motion , 1991, STOC '91.

[14]  Steven K. Feiner,et al.  Fast object-precision shadow generation for area light sources using BSP trees , 1992, I3D '92.

[15]  Bruce F. Naylor,et al.  Interactive solid geometry via partitioning trees , 1992 .

[16]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[17]  Steven K. Feiner,et al.  Introduction to Computer Graphics Macintosh Version Software of SRGP and SPHIGS Software , 1994 .

[18]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[19]  Zbigniew Michalewicz,et al.  Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques , 1995 .

[20]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[21]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[22]  T. M. Murali,et al.  Consistent solid and boundary representations from arbitrary polygonal data , 1997, SI3D.

[23]  Leonidas J. Guibas,et al.  Cylindrical static and kinetic binary space partitions , 2000, Comput. Geom..