Back to Results
First PageMeta Content
Triangulation / Polyhedra / Polygons / Pseudotriangle / Polytopes / Polyhedron / Dual polyhedron / Octahedron / Planar graph / Geometry / Euclidean geometry / Euclidean plane geometry


Open Problems from CCCG 2001 Erik D. Demaine∗ Joseph O’Rourke† The following is a list of the problems presented on
Add to Reading List

Document Date: 2012-08-17 18:04:17

Open Document

File Size: 92,39 KB

Share Result on Facebook

City

Santos / J. Snoeyink / Waterloo / /

Company

Vertex / MIT Laboratory / /

Country

Canada / /

Currency

pence / /

/

Facility

Smith College / Rutgers University / //cs.smith.edu/~streinu/Research/ Problems/ArrangMatch/problem.html Proximate Point Location John Iacono Polytechnic University / Technology Square / /

IndustryTerm

greedy flip algorithm / binary search trees / /

NaturalFeature

Chapel Hill / /

Organization

National Science Foundation / Smith College / Department of Computer Science / MIT / Rutgers University / //cs.smith.edu/~streinu/Research/ Problems/ArrangMatch/problem.html Proximate Point Location John Iacono Polytechnic University / /

Person

Robert Optimal / David Eppstein / John Iacono / Fumihiko Takeuchi / Andrea Mantler / Franz Aurenhammer / Bettina Speckmann / William Steiger / Oswin Aichholzer / David Kirkpatrick / Jack Snoeyink / Jeff Erickson / Lutz Kettner / Stefan Langerman / Erik Demaine / George W. Hart / Ileana Streinu / Mark R. Brown / Therese Biedl / Hannes Krasser / Daniel Dominic Sleator / Erik D. Demaine∗ Joseph / Valerio Pascucci / Erik D. Demaine / Robert Endre Tarjan / Carr U. British Columbia / /

PublishedMedium

Journal of the ACM / /

Technology

200 Technology / http / simulation / html / greedy flip algorithm / /

URL

http /

SocialTag