Computational geometry: an introduction
Computational geometry: an introduction
Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
SIAM Journal on Computing
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
An almost linear time algorithm for generalized matrix searching
SIAM Journal on Discrete Mathematics
Fast matching algorithms for points on a polygon
SIAM Journal on Computing
Handbook of theoretical computer science (vol. A)
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
Minimum diameter spanning trees and related problems
SIAM Journal on Computing
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computing in Euclidean geometry
Computing in Euclidean geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Point location among hyperplanes and unidirectional ray-shooting
Computational Geometry: Theory and Applications
ACM Computing Surveys (CSUR)
Rectilinear Path Problems Among Rectilinear ObstaclesRevisited
SIAM Journal on Computing
An optimal algorithm for roundness determination on convex polygons
Computational Geometry: Theory and Applications
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
New Techniques for Exact and Approximate Dynamic Closest-point
SIAM Journal on Computing
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear paths among rectilinear obstacles
Discrete Applied Mathematics
Finding a shortest diagonal of a simple polygon in linear time
Computational Geometry: Theory and Applications
Finding the largest area axis-parallel rectangle in a polygon
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Handbook of discrete and computational geometry
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
SIAM Journal on Computing
A constant-factor approximation algorithm for the k-MST problem
Journal of Computer and System Sciences
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
More planar two-center algorithms
Computational Geometry: Theory and Applications
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Handbook of computational geometry
Handbook of computational geometry
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
SIAM Journal on Computing
Efficient algorithms for line and curve segment intersection using restricted predicates
Computational Geometry: Theory and Applications
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The Voronoi Diagram of Curved Objects
Discrete & Computational Geometry
The Rectilinear Steiner Arborescence Problem Is NP-Complete
SIAM Journal on Computing
Geometric Spanner Networks
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Efficient computation of Euclidean shortest paths in the plane
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
IEEE Transactions on Visualization and Computer Graphics
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Robustness of k-gon Voronoi diagram construction
Information Processing Letters
New approximations for the rectilinear Steiner arborescence problem [VLSI layout]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |