Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Practical techniques for constructing binary space partitions for orthogonal rectangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cutting cylces of rods in space
Proceedings of the fourteenth annual symposium on Computational geometry
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth 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 axis-parallel segments, rectangles, and hyperrectangles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A note on binary plane partitions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Binary space partitions for axis-paralles line segments: size-height tradeoffs
Information Processing Letters
Binary space partitions for 3D subdivisions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Binary Space Partitions in Plücker Space
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Angle counts for isothetic polygons and polyhedra
Pattern Recognition Letters
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Binary space partitions of orthogonal subdivisions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
Binary plane partitions for disjoint line segments
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximate range searching using binary space partitions
Computational Geometry: Theory and Applications
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Faster algorithms for minimum-link paths with restricted orientations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Grid vertex-unfolding orthogonal polyhedra
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On communication protocols that compute almost privately
Theoretical Computer Science
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.02 |