2008 |
40 | | Mashhood Ishaque,
Diane L. Souvaine,
Nadia Benbernou:
Data Structures for Restricted Triangular Range Searching.
CCCG 2008 |
39 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues
CoRR abs/0803.0316: (2008) |
38 | EE | David W. Krumme,
Eynat Rafalin,
Diane L. Souvaine,
Csaba D. Tóth:
Tight Bounds for Connecting Sites Across Barriers.
Discrete & Computational Geometry 40(3): 377-394 (2008) |
37 | EE | Eynat Rafalin,
Diane L. Souvaine:
Topological sweep of the complete graph.
Discrete Applied Mathematics 156(17): 3276-3290 (2008) |
36 | EE | Oswin Aichholzer,
Sergey Bereg,
Adrian Dumitrescu,
Alfredo García,
Clemens Huemer,
Ferran Hurtado,
Mikio Kano,
Alberto Márquez,
David Rappaport,
Shakhar Smorodinsky,
Diane L. Souvaine,
Jorge Urrutia,
David R. Wood:
Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics 31: 201-206 (2008) |
35 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues.
Natural Computing 7(3): 347-370 (2008) |
2007 |
34 | | Nadia Benbernou,
Erik D. Demaine,
Martin L. Demaine,
Michael Hoffmann,
Mashhood Ishaque,
Diane L. Souvaine,
Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
CCCG 2007: 13-16 |
33 | EE | Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Mashhood Ishaque,
Eynat Rafalin,
Robert T. Schweller,
Diane L. Souvaine:
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues.
DNA 2007: 1-14 |
32 | EE | Eynat Rafalin,
Diane L. Souvaine,
Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles.
WADS 2007: 470-482 |
2006 |
31 | EE | Prosenjit Bose,
David Bremner,
Diane L. Souvaine:
Computing the Tool Path of an Externally Monotone Polygon in Linear Time.
CCCG 2006 |
30 | EE | Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Vida Dujmovic,
Dania El-Khechen,
Robin Y. Flatland,
John Iacono,
Stefan Langerman,
Henk Meijer,
Suneeta Ramaswami,
Diane L. Souvaine,
Perouz Taslakian,
Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing.
CCCG 2006 |
29 | EE | David W. Krumme,
Eynat Rafalin,
Diane L. Souvaine,
Csaba D. Tóth:
Tight bounds for connecting sites across barriers.
Symposium on Computational Geometry 2006: 439-448 |
2005 |
28 | EE | Csaba D. Tóth,
Diane L. Souvaine:
A vertex-face assignment for plane graphs.
CCCG 2005: 138-141 |
27 | EE | Craig Falls,
Yuanxin Liu,
Jack Snoeyink,
Diane L. Souvaine:
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.
CCCG 2005: 35-38 |
26 | EE | Erik D. Demaine,
Martin L. Demaine,
Jeffrey F. Lindy,
Diane L. Souvaine:
Hinged Dissection of Polypolyhedra.
WADS 2005: 205-217 |
25 | EE | Ruth Haas,
David Orden,
Günter Rote,
Francisco Santos,
Brigitte Servatius,
Herman Servatius,
Diane L. Souvaine,
Ileana Streinu,
Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom. 31(1-2): 31-61 (2005) |
2004 |
24 | EE | Michael Burr,
Alan Cheng,
Ryan Coleman,
Diane L. Souvaine:
Transformations and algorithms for least sum of squares hypersphere fitting.
CCCG 2004: 104-107 |
23 | EE | Michael Burr,
Eynat Rafalin,
Diane L. Souvaine:
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case.
CCCG 2004: 136-139 |
2003 |
22 | EE | Ruth Haas,
David Orden,
Günter Rote,
Francisco Santos,
Brigitte Servatius,
Herman Servatius,
Diane L. Souvaine,
Ileana Streinu,
Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations.
Symposium on Computational Geometry 2003: 154-163 |
21 | EE | Kim Miller,
Suneeta Ramaswami,
Peter Rousseeuw,
Joan Antoni Sellarès,
Diane L. Souvaine,
Ileana Streinu,
Anja Struyf:
Efficient computation of location depth contours by methods of computational geometry.
Statistics and Computing 13(2): 153-162 (2003) |
2002 |
20 | EE | Eynat Rafalin,
Diane L. Souvaine,
Ileana Streinu:
Topological Sweep in Degenerate Cases.
ALENEX 2002: 155-165 |
19 | EE | Frederick Crimins,
Diane L. Souvaine:
Constructing differentiable homeomorphisms between isomorphic triangulations.
CCCG 2002: 170-173 |
2001 |
18 | EE | Kim Miller,
Suneeta Ramaswami,
Peter Rousseeuw,
Joan Antoni Sellarès,
Diane L. Souvaine,
Ileana Streinu,
Anja Struyf:
Fast implementation of depth contours using topological sweep.
SODA 2001: 690-699 |
1997 |
17 | | Mark Babikov,
Diane L. Souvaine,
Rephael Wenger:
Constructing piecewise linear homeomorphisms of polygons with holes.
CCCG 1997 |
16 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
Comput. Geom. 8: 97-114 (1997) |
15 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
Int. J. Comput. Geometry Appl. 7(1/2): 153-163 (1997) |
1995 |
14 | | Diane L. Souvaine,
Chee-Keng Yap:
Combinatorial Complexity of Signed Discs.
Comput. Geom. 5: 207-223 (1995) |
13 | | Iliana Bjorling-Sachs,
Diane L. Souvaine:
An Efficient Algorithm for Guard Placement in Polygons with Holes.
Discrete & Computational Geometry 13: 77-109 (1995) |
1994 |
12 | | Diane L. Souvaine,
Christopher J. Van Wyk:
Clamping a polygon.
The Visual Computer 10(8): 484-494 (1994) |
1993 |
11 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
CCCG 1993: 387 |
10 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
CCCG 1993: 399-404 |
9 | | Diane L. Souvaine,
Chee-Keng Yap:
Combinatorial Complexity of Signed Discs (Extended Abstract).
WADS 1993: 577-588 |
8 | | Boris Aronov,
Raimund Seidel,
Diane L. Souvaine:
On Compatible Triangulations of Simple Polygons.
Comput. Geom. 3: 27-35 (1993) |
1992 |
7 | EE | Elefterios A. Melissaratos,
Diane L. Souvaine:
Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes.
Symposium on Computational Geometry 1992: 202-211 |
6 | | Elefterios A. Melissaratos,
Diane L. Souvaine:
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions.
SIAM J. Comput. 21(4): 601-638 (1992) |
1991 |
5 | | Jirel Czyzowicz,
Peter Egyed,
Hazel Everett,
David Rappaport,
Thomas C. Shermer,
Diane L. Souvaine,
Godfried T. Toussaint,
Jorge Urrutia:
The Aquarium Keeper's Problem.
SODA 1991: 459-464 |
4 | EE | David P. Dobkin,
Diane L. Souvaine:
Detecting the intersection of convex objects in the plane.
Computer Aided Geometric Design 8(3): 181-199 (1991) |
1990 |
3 | EE | Elefterios A. Melissaratos,
Diane L. Souvaine:
On Solving Geometric Optimization Problems Using Shortest Paths.
Symposium on Computational Geometry 1990: 350-359 |
2 | | David P. Dobkin,
Diane L. Souvaine:
Computational Geometry in a Curved World.
Algorithmica 5(3): 421-457 (1990) |
1988 |
1 | | David P. Dobkin,
Diane L. Souvaine,
Christopher J. Van Wyk:
Decomposition and Intersection of Simple Splinegons.
Algorithmica 3: 473-485 (1988) |