Computational geometry
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. 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
- Math-217 Polynomial Diameter Bounds for Polyhedra
- Math-1655 Point Location in 3D Subdivision
- Math-1661 Hamiltonian Tetrahedralizations
- Math-1664 The Number of Pointed Pseudotriangulations
- Math-2165 Dynamic Planar Nearest Neighbors
- Math-3998 Simple Linear-Time Polygon Triangulation
- Math-4001 Compatible Triangulations
- Math-4425 Geometry, residues, and scale thresholds for prescribed-prefix prime products
- Math-4446 Finite resource bounds for random spherical covering
- Math-4485 Decidability of Simplicial-Complex Embeddability
- Math-4486 Rotational Matching Complexity for Planar Point Sets
- Math-4487 Convex-Hull Decomposition for Mixed-Integer Bipartite Systems
- Math-4493 Global Observability from Negative Gramian Curvature
- Math-4499 Integer Carathéodory Property for Intersecting Matroid Base Polytopes
- Math-4500 Integer Carathéodory Property for Arborescence Polytopes
- Math-4501 Greedy Decomposition of the Spanning-Tree Polytope
- Math-4502 Density and Geometry Recovery from Nearest-Neighbor Graphs
- Math-4517 Complexity of Embedding Two-Complexes in Three-Manifolds
- Math-4519 Volume of the Boolean Quadric Polytope
- Math-4552 Geometric Explanations and Polynomial Pivot Rules for Simplex
- Math-4561 Computational Recognition of Polytope Face Vectors and Cones
- Math-4563 Minimum Crossing Realizations of Spatial Polygon Angle Sequences
- Math-4567 Extension Complexity of Inscribed Fixed-Dimensional Polytopes
- Math-4573 Balanced Signings in the Subtour Polytope
- Math-4621 Fixed-Parameter Tractability of Zonotope Containment
- Math-5202 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- Math-5203 Polyhedral Information Derived from Known Symmetries
- Math-5225 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- Math-5232 Subexponential Completeness Testing for Voronoi Cell Representatives
- Math-5233 Discrete Vector Fields for Voronoi-Cohomology Computations
- Math-5256 Adaptive Refinement and Global Optimization of Topological Shapes
- Math-5259 Primal and Dual Geometry of SONC Relaxations
- Math-5262 Geometric Analogues of Finite Effective Complexity