#### Filter Results:

#### Publication Year

1988

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Erik D. Demaine, Martin L. Demaine, +4 authors Diane L. Souvaine
- Natural Computing
- 2007

We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario through protein-based bioengi-neering. Staging allows us to break through… (More)

- David P. Dobkin, Diane L. Souvaine
- Algorithmica
- 1990

- Steven C. Beering, Mark R. Abbott, +12 authors Thomas N. Taylor
- 2010

Scientific and technological innovation continues to play an essential role in catalyzing the creation of new industries, spawning job growth, and improving the quality of life in the United States and throughout the world. Innovation relies, in part, on individuals possessing the knowledge, skills, creativity, and foresight to forge new paths. The National… (More)

- David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk
- Algorithmica
- 1988

- Brad Ballinger, Nadia Benbernou, +11 authors Ryuhei Uehara
- J. Comb. Optim.
- 2010

The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.

- Boris Aronov, Raimund Seidel, Diane L. Souvaine
- Comput. Geom.
- 1993

It is well known that, given two simple n-sided polygons, it may not be possible to triangulate the two polygons in a compatible fashion, if one's choice of triangulation vertices is restricted to polygon corners. Is it always possible to produce compatible triangulations if additional vertices inside the polygon are allowed? We give a positive answer and… (More)

- Justin Colannino, Mirela Damian, +5 authors Godfried T. Toussaint
- Graphs and Combinatorics
- 2007

Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least one point in S, such that sum of the matching costs is minimized. Here we examine the special case where both S and T lie on the line and the cost of matching s ∈ S to t… (More)

- John Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine
- ALENEX
- 2006

Data depth is a statistical analysis method that assigns a numeric value to a point based on its centrality relative to a data set. Examples include the half-space depth (also known as Tukey depth), convex-hull peeling depth and L1 depth. Data depth has significant potential as a data analysis tool. The lack of efficient computational tools for depth based… (More)

- Michael A. Burr, Eynat Rafalin, Diane L. Souvaine
- CCCG
- 2003

As proposed by Liu [8] the simplicial depth of a point with respect to a data set in is the fraction of closed sim-plices given by ! # " of the data points containing. We propose an alternative definition for simplicial depth which remains valid over a continuous probability field and fixes some problems in the finite sample case. A data depth measures how… (More)

- David P. Dobkin, Diane L. Souvaine
- Computer Aided Geometric Design
- 1991