next up previous
Next: Numerical List of All

The Open Problems Project

edited by  Erik D. Demaine

Joseph S. B. Mitchell

Joseph O'Rourke


Introduction

This is the beginning of a project1 to record open problems of interest to researchers in computational geometry and related fields. It commenced with the publication of thirty problems in Computational Geometry Column 42 [MO01] (see Problems 1-30), but has grown much beyond that. We encourage correspondence to improve the entries; please send email to topp@csail.mit.edu. If you would like to submit a new problem, please fill out this template.

Each problem is assigned a unique number for citation purposes. Problem numbers also indicate the order in which the problems were entered. Each problem is classified as belonging to one or more categories.

The problems are also available as a single Postscript or PDF file.

To begin navigating through the open problems, you may select from a category of interest below, or view a list of all problems sorted numerically.


Categorized List of All Problems

Below, each category lists the problems that are classified under that category. Note that each problem may be classified under several categories.

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.:

planar graphs:

point sets:

point sets.:

polygons:

polyhedra:

reconstruction:

robotics:

scheduling:

shortest paths:

simplification:

spanners:

stabbing:

traveling salesman:

triangulations:

visibility:

Voronoi diagrams:



Footnotes

... project1
Partially supported by NSF grants to the three editors.

next up previous
Next: Numerical List of All
The Open Problems Project - December 08, 2012