Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming in O(n × 3d2) time
Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Randomized optimal algorithm for slope selection
Information Processing Letters
Off-line dynamic maintenance of the width of a planar point set
Computational Geometry: Theory and Applications
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Computational Geometry: Theory and Applications
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for roundness determination on convex polygons
Computational Geometry: Theory and Applications
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Computating the width of a set
SCG '85 Proceedings of the first annual symposium on Computational geometry
A complete roundness classification procedure
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Computing roundness is easy if the set is almost round
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
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Exact and approximation algorithms for minimum-width cylindrical shells
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Testing the Quality of Manufactured Balls
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Optimizing Constrained Offset and Scaled Polygonal Annuli
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Testing the Quality of Manufactured Disks and Cylinders
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximation Algorithms for k-Line Center
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximation algorithms for projective clustering
Journal of Algorithms
A (1 + ɛ)-approximation algorithm for 2-line-center
Computational Geometry: Theory and Applications
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Faster core-set constructions and data stream algorithms in fixed dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
On overlays and minimization diagrams
Proceedings of the twenty-second annual symposium on Computational geometry
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Covering points with a polygon
Computational Geometry: Theory and Applications
Proceedings of the twenty-fourth annual symposium on Computational geometry
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Algorithms and theory of computation handbook
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
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Geometric optimization problems over sliding windows
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Journal of Computational and Applied Mathematics
Minimum-width rectangular annulus
Theoretical Computer Science
| Hi-index | 0.00 |