Get the latest tech news

Open Problems in Computational geometry

This project originally aimed to record important open problems of interest to researchers in computational geometry and related fields. It commenced in 2001 with the publication of thirty problems in Computational Geometry Column 42 [MO01] (see Problems 1–30), and then grew to over 75 problems.

This project originally aimed to record important open problems of interest to researchers in computational geometry and related fields. arrangements:art galleries:coloring:combinatorial geometry:convex hulls:data structures:Delaunay triangulations:dissections:folding and unfolding:geometric graphs:graph drawing:graphs:linear programming:lower bounds:meshing:minimum spanning tree:numerical computations:optimization:packing:partitioning:partitioning. :polygons:polyhedra:reconstruction:robotics:scheduling:shortest paths:simplification:spanners:stabbing:traveling salesman:triangulations:visibility:Voronoi diagrams:[MO01] J. S. B. Mitchell and Joseph O’Rourke.

Get the Android app