Computational geometry: an introduction
Computational geometry: an introduction
Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
Polygon triangulation: efficiency and minimality
Journal of Algorithms
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Art gallery theorems and algorithms
Art gallery theorems and algorithms
An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
Covering orthogonal polygons with star polygons: the perfect graph approach
Journal of Computer and System Sciences
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
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
Handbook of theoretical computer science (vol. A)
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
Computing in Euclidean geometry
Computing in Euclidean geometry
A quadratic time algorithm for the minmax length triangulation
SIAM Journal on Computing
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Ray shooting and parametric search
SIAM Journal on Computing
On covering orthogonal polygons with star-shaped polygons
Information Sciences: an International Journal
Orthogonal weighted linear L1 and L∞ approximation and applications
Discrete Applied Mathematics
An on-line algorithm for constrained Delaunay triangulation
CVGIP: Graphical Models and Image Processing
Journal of Algorithms
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry: Theory and Applications
Output-sensitive peeling of convex and maximal layers
Information Processing Letters
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Matrix Searching with the Shortest-Path Metric
SIAM Journal on Computing
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Handbook of computational geometry
Handbook of computational geometry
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Acute triangulations of polygons
European Journal of Combinatorics
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Proximity and reachability in the plane.
Proximity and reachability in the plane.
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Three-Dimensional Layers of Maxima
Algorithmica
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
ACM Transactions on Algorithms (TALG)
Acute Triangulations of Polygons
Discrete & Computational Geometry
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
Acute Triangulations of Flat Mobius Strips
Discrete & Computational Geometry
Triangulations with locally optimal Steiner points
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry: Theory and Applications
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Sweep-line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science
IEEE Transactions on Visualization and Computer Graphics
Acute and nonobtuse triangulations of polyhedral surfaces
European Journal of Combinatorics
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Hi-index | 0.00 |