Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu

Source URL: student.ulb.ac.be

Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine†

Source URL: www.eecs.tufts.edu

• Mathematics
• Algebra
• Graph theory
• Convex analysis
• Convex geometry
• Algebraic graph theory
• Dual graph
• Convex set
• Line segment
• Convex function

Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu

Source URL: homepages.ulb.ac.be

6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 5 — September 18, 2014 Prof. Erik Demaine

Source URL: courses.csail.mit.edu

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Curves in the Sand: Algorithmic Drawing Mirela Damian∗ Erik D. Demaine†

Source URL: homepages.ulb.ac.be

MITAdvanced Data Structures Prof. Erik Demaine Spring ’12 Scribe Notes Collection TA: Tom Morgan, Justin Zhang

Source URL: courses.csail.mit.edu

OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗

Source URL: www-cgrl.cs.mcgill.ca

Unfolding Orthogrids with Constant Refinement∗ Mirela Damian† Erik Demaine‡ genus zero composed of extrusions of simple polygons (which we call slabs) stacked together so that

Source URL: www-cs.engr.ccny.cuny.edu

CCCG 2010, Winnipeg MB, August 9–11, 2010 Bounded-Degree Polyhedronization of Point Sets Gill Barequet Martin L. Demaine

Source URL: people.csail.mit.edu

Mashhood Ishaque Department of Computer Science Tufts University Medford, MAEmail:

Source URL: www.eecs.tufts.edu

• Mathematics
• Academia
• Computer science
• Erik Demaine
• Diane Souvaine
• Godfried Toussaint
• Tufts University
• Anna Lubiw
• Demaine