<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2002-08-07 16:32:54Convex optimization Discrete geometry Convex geometry Polygon triangulation Godfried Toussaint Simple polygon Star-shaped polygon Monotone polygon Geodesic Geometry Polygons Computational geometry |
 | Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UKDocID: 1q1E0 - View Document |
 | CCCG 2011, Toronto ON, August 10–12, 2011 Open Guard Edges and Edge Guards in Simple Polygons Csaba D. T´ oth∗DocID: 18Z4s - View Document |
 | CCCG 2009, Vancouver, BC, August 17–19, 2009 Open Problems from CCCG 2008 Erik D. Demaine∗ The following is a list of the problems presented onDocID: 18HOy - View Document |
 | CCCG 2010, Winnipeg MB, August 9–11, 2010 k-Star-shaped Polygons∗ William Evans† AbstractDocID: 18z2X - View Document |
 | CCCG 2011, Toronto ON, August 10–12, 2011 Computing k-Link Visibility Polygons in Environments with a Reflective Edge Salma S. Mahdavi ∗DocID: 18y0q - View Document |