On fence design and the complexity of push plans for orienting parts
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the union of κ-curved objects
Proceedings of the fourteenth annual symposium on Computational geometry
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Overlapping multi-processing and graphics hardware acceleration: performance evaluation
PVGS '99 Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics
Analysis of a bounding box heuristic for object intersection
Journal of the ACM (JACM)
Analyzing bounding boxes for object intersection
ACM Transactions on Graphics (TOG)
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Smoothed analysis of probabilistic roadmaps
Computational Geometry: Theory and Applications
Binary plane partitions for disjoint line segments
Proceedings of the twenty-fifth annual symposium on Computational geometry
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
| Hi-index | 0.00 |