Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fitting a set of points by a circle
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing the minimum diameter for moving points: an exact implementation using parametric search
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Line transversals of balls and smallest enclosing cylinders in three dimensions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Largest Empty Annulus Problem
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimized color gamuts for tiled displays
Proceedings of the nineteenth annual symposium on Computational geometry
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
Almost tight upper bounds for vertical decompositions in four dimensions
Journal of the ACM (JACM)
Finding large sticks and potatoes in polygons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
Minimum width rectangular annulus
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
k-enclosing axis-parallel square
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Covering and piercing disks with two centers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
One-way and round-trip center location problems
Discrete Optimization
Covering and piercing disks with two centers
Computational Geometry: Theory and Applications
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Algorithms for hotspot computation on trajectory data
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Minimum-width rectangular annulus
Theoretical Computer Science
An approximation algorithm for k-center problem on a convex polygon
Journal of Combinatorial Optimization
| Hi-index | 0.00 |