Computational geometry: an introduction
Computational geometry: an introduction
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Computational Geometry: Theory and Applications
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry: Theory and Applications
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
Journal of Algorithms
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing Envelopes in Four Dimensions with Applications
SIAM Journal on Computing
Handbook of discrete and computational geometry
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
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Evaluating the cylindricity of a nominally cylindrical point set
SODA '00 Proceedings of the eleventh 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
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Algorithms for the Smallest Enclosing Cylinder Problem
Proceedings of the 8th Canadian Conference on Computational Geometry
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Penetration depth of two convex polytopes in 3D
Nordic Journal of Computing
Computing the Penetration Depth of Two Convex Polytopes in 3D
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Approximating 3D Points with Cylindrical Segments
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Facility Location and the Geometric Minimum-Diameter Spanning Tree
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Facility location and the geometric minimum-diameter spanning tree
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Cylindrical hierarchy for deforming necklaces
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Toward a Robust Search Method for the Protein-Drug Docking Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Journal of Computational and Applied Mathematics
Training minimum enclosing balls for cross tasks knowledge transfer
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
| Hi-index | 0.00 |