Computational geometry
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
33 records · Search and filter
- CS-48 Polynomial Diameter Bounds for Polyhedra
- CS-94 Point Location in 3D Subdivision
- CS-96 Hamiltonian Tetrahedralizations
- CS-97 The Number of Pointed Pseudotriangulations
- CS-106 Dynamic Planar Nearest Neighbors
- CS-181 Simple Linear-Time Polygon Triangulation
- CS-182 Compatible Triangulations
- CS-236 Geometry, residues, and scale thresholds for prescribed-prefix prime products
- CS-257 Finite resource bounds for random spherical covering
- CS-296 Decidability of Simplicial-Complex Embeddability
- CS-297 Rotational Matching Complexity for Planar Point Sets
- CS-298 Convex-Hull Decomposition for Mixed-Integer Bipartite Systems
- CS-304 Global Observability from Negative Gramian Curvature
- CS-310 Integer Carathéodory Property for Intersecting Matroid Base Polytopes
- CS-311 Integer Carathéodory Property for Arborescence Polytopes
- CS-312 Greedy Decomposition of the Spanning-Tree Polytope
- CS-313 Density and Geometry Recovery from Nearest-Neighbor Graphs
- CS-328 Complexity of Embedding Two-Complexes in Three-Manifolds
- CS-330 Volume of the Boolean Quadric Polytope
- CS-363 Geometric Explanations and Polynomial Pivot Rules for Simplex
- CS-372 Computational Recognition of Polytope Face Vectors and Cones
- CS-374 Minimum Crossing Realizations of Spatial Polygon Angle Sequences
- CS-378 Extension Complexity of Inscribed Fixed-Dimensional Polytopes
- CS-384 Balanced Signings in the Subtour Polytope
- CS-432 Fixed-Parameter Tractability of Zonotope Containment
- CS-667 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- CS-668 Polyhedral Information Derived from Known Symmetries
- CS-690 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- CS-697 Subexponential Completeness Testing for Voronoi Cell Representatives
- CS-698 Discrete Vector Fields for Voronoi-Cohomology Computations
- CS-721 Adaptive Refinement and Global Optimization of Topological Shapes
- CS-724 Primal and Dual Geometry of SONC Relaxations
- CS-727 Geometric Analogues of Finite Effective Complexity