Computational geometry: an introduction
Computational geometry: an introduction
Optimal point location in a monotone subdivision
SIAM Journal on Computing
SIAM Journal on Computing
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Approximating the diameter of a set of points in the Euclidean space
Information Processing Letters
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & 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
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
A complete roundness classification procedure
SCG '97 Proceedings of the thirteenth 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 Envelopes in Four Dimensions with Applications
SIAM Journal on Computing
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Linear programming in low dimensions
Handbook of discrete and computational geometry
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Roundness estimation via random sampling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing Constrained Minimum-Width Annuli of Point Sets
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Computing roundness is easy if the set is almost round
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An efficient, exact, and generic quadratic programming solver for geometric optimization
Proceedings of the sixteenth 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
Evaluating the cylindricity of a nominally cylindrical point set
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
| Hi-index | 0.00 |