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
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
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Visibility computations in densely occluded polyhedral environments
Visibility computations in densely occluded polyhedral environments
Randomized algorithms
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Computer Graphics
Introduction to Computer Graphics
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations
Constructing cuttings in theory and practice
Proceedings of the fourteenth annual symposium on Computational geometry
Lower bounds for kinetic planar subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A segment-tree based kinetic BSP
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Binary space partitions for line segments with a limited number of directions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Scene Occlusion Culling
IEEE Transactions on Visualization and Computer Graphics
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Journal of Computer and System Sciences - Special issue on PODS 2000
Binary-Space-Partitioned Images for Resolving Image-Based Visibility
IEEE Transactions on Visualization and Computer Graphics
A computational framework for incremental motion
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Broad-phase collision detection using semi-adjusting BSP-trees
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Change Tolerant Indexing for Constantly Evolving Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry: Theory and Applications
Buddy tracking - efficient proximity detection among mobile friends
Pervasive and Mobile Computing
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |