Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
The complexity of cutting complexes
Discrete & Computational Geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast Detection of Polyhedral Intersections
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Average-case ray shooting and minimum weight triangulations
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate minimum weight Steiner triangulation in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry
Minimizing the stabbing number of matchings, trees, and triangulations
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
Approximate Euclidean shortest paths amid convex obstacles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The minimum stabbing triangulation problem: IP models and computational evaluation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |