Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
Output-sensitive construction of the union of triangles
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Counting and representing intersections among triangles in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |