The SCEAS System
| |||||||

## Search the dblp DataBase
Diane L. Souvaine:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eynat Rafalin, Diane L. Souvaine, Ileana Streinu
**Topological Sweep in Degenerate Cases.**[Citation Graph (0, 0)][DBLP] ALENEX, 2002, pp:155-165 [Conf] - Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
**Testing Simple Polygons.**[Citation Graph (0, 0)][DBLP] CCCG, 1993, pp:387- [Conf] - Mark Babikov, Diane L. Souvaine, Rephael Wenger
**Constructing piecewise linear homeomorphisms of polygons with holes.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
**The Floodlight Problem.**[Citation Graph (0, 0)][DBLP] CCCG, 1993, pp:399-404 [Conf] - Michael Burr, Alan Cheng, Ryan Coleman, Diane L. Souvaine
**Transformations and algorithms for least sum of squares hypersphere fitting.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:104-107 [Conf] - Michael Burr, Eynat Rafalin, Diane L. Souvaine
**Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:136-139 [Conf] - Frederick Crimins, Diane L. Souvaine
**Constructing differentiable homeomorphisms between isomorphic triangulations.**[Citation Graph (0, 0)][DBLP] CCCG, 2002, pp:170-173 [Conf] - Craig Falls, Yuanxin Liu, Jack Snoeyink, Diane L. Souvaine
**Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:35-38 [Conf] - Csaba D. Tóth, Diane L. Souvaine
**A vertex-face assignment for plane graphs.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:138-141 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:154-163 [Conf] - David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
**Tight bounds for connecting sites across barriers.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:439-448 [Conf] - Elefterios A. Melissaratos, Diane L. Souvaine
**On Solving Geometric Optimization Problems Using Shortest Paths.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1990, pp:350-359 [Conf] - Elefterios A. Melissaratos, Diane L. Souvaine
**Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1992, pp:202-211 [Conf] - Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
**The Aquarium Keeper's Problem.**[Citation Graph (0, 0)][DBLP] SODA, 1991, pp:459-464 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:690-699 [Conf] - Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
**Hinged Dissection of Polypolyhedra.**[Citation Graph (0, 0)][DBLP] WADS, 2005, pp:205-217 [Conf] - Diane L. Souvaine, Chee-Keng Yap
**Combinatorial Complexity of Signed Discs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] WADS, 1993, pp:577-588 [Conf] - David P. Dobkin, Diane L. Souvaine
**Computational Geometry in a Curved World.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1990, v:5, n:3, pp:421-457 [Journal] - David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk
**Decomposition and Intersection of Simple Splinegons.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1988, v:3, n:, pp:473-485 [Journal] - David P. Dobkin, Diane L. Souvaine
**Detecting the intersection of convex objects in the plane.**[Citation Graph (0, 0)][DBLP] Computer Aided Geometric Design, 1991, v:8, n:3, pp:181-199 [Journal] - Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
**Testing Simple Polygons.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal] - Boris Aronov, Raimund Seidel, Diane L. Souvaine
**On Compatible Triangulations of Simple Polygons.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1993, v:3, n:, pp:27-35 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:31, n:1-2, pp:31-61 [Journal] - Diane L. Souvaine, Chee-Keng Yap
**Combinatorial Complexity of Signed Discs.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1995, v:5, n:, pp:207-223 [Journal] - Iliana Bjorling-Sachs, Diane L. Souvaine
**An Efficient Algorithm for Guard Placement in Polygons with Holes.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1995, v:13, n:, pp:77-109 [Journal] - Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
**The Floodlight Problem.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:153-163 [Journal] - Elefterios A. Melissaratos, Diane L. Souvaine
**Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:4, pp:601-638 [Journal] - Diane L. Souvaine, Christopher J. Van Wyk
**Clamping a polygon.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 1994, v:10, n:8, pp:484-494 [Journal] - Prosenjit Bose, David Bremner, Diane L. Souvaine
**Computing the Tool Path of an Externally Monotone Polygon in Linear Time.**[Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf] - 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.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:13-16 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf] - Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
**Cuttings for Disks and Axis-Aligned Rectangles.**[Citation Graph (0, 0)][DBLP] WADS, 2007, pp:470-482 [Conf] **Data Structures for Restricted Triangular Range Searching.**[Citation Graph (, )][DBLP]**Bounded-degree polyhedronization of point sets.**[Citation Graph (, )][DBLP]**Convex Partitions with 2-Edge Connected Dual Graphs.**[Citation Graph (, )][DBLP]**Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with**[Citation Graph (, )][DBLP]*O*(1) Glues.**Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs.**[Citation Graph (, )][DBLP]**Compatible geometric matchings.**[Citation Graph (, )][DBLP]**A vertex-face assignment for plane graphs.**[Citation Graph (, )][DBLP]**Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues**[Citation Graph (, )][DBLP]**Topological sweep of the complete graph.**[Citation Graph (, )][DBLP]**Tight Bounds for Connecting Sites Across Barriers.**[Citation Graph (, )][DBLP]**Cuttings for Disks and Axis-Aligned Rectangles in Three-Space.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |