A new polynomial-time algorithm for linear programming
Combinatorica
SIAM Journal on Computing
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
Computational Geometry: Theory and Applications
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Ray shooting and other applications of spanning trees with low stabbing number
SIAM Journal on Computing
Computational geometry column 18
ACM SIGACT News
An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Illumination of polygons with vertex lights
Information Processing Letters
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Separation and approximation of polyhedral objects
Computational Geometry: Theory and Applications
On Conway's thrackle conjecture
Proceedings of the eleventh annual symposium on Computational geometry
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Linear complexity hexahedral mesh generation
Proceedings of the twelfth annual symposium on Computational geometry
A lower bound for randomized algebraic decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Generating random polygons with given vertices
Computational Geometry: Theory and Applications
On the area of the intersection of disks in the plane
Computational Geometry: Theory and Applications
Near-quadratic bounds for the L1 Voronoi diagram of moving points
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Computational Geometry: Theory and Applications
Vertex-edge pseudo-visibility graphs: characterization and recognition
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Surface Approximation and Geometric Partitions
SIAM Journal on Computing
Handbook of discrete and computational geometry
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A note on binary plane partitions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Ununfoldable polyhedra with convex faces
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Folding and Unfolding in Computational Geometry
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Heuristics for the Generation of Random Polygons
Proceedings of the 8th Canadian Conference on Computational Geometry
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
Proceedings of the eighteenth annual symposium on Computational geometry
Allocating vertex π-guards in simple polygons via pseudo-triangulations
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM (JACM)
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
An incremental algorithm for distributed minimum weight triangulation
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
The minimum stabbing triangulation problem: IP models and computational evaluation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
A compendium of thirty previously published open problems in computational geometry is presented