The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Diane L. Souvaine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eynat Rafalin, Diane L. Souvaine, Ileana Streinu
    Topological Sweep in Degenerate Cases. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:155-165 [Conf]
  2. 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]
  3. Mark Babikov, Diane L. Souvaine, Rephael Wenger
    Constructing piecewise linear homeomorphisms of polygons with holes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Frederick Crimins, Diane L. Souvaine
    Constructing differentiable homeomorphisms between isomorphic triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:170-173 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Diane L. Souvaine, Chee-Keng Yap
    Combinatorial Complexity of Signed Discs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:577-588 [Conf]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]

  33. Data Structures for Restricted Triangular Range Searching. [Citation Graph (, )][DBLP]


  34. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  35. Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (, )][DBLP]


  36. Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. [Citation Graph (, )][DBLP]


  37. Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. [Citation Graph (, )][DBLP]


  38. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  39. A vertex-face assignment for plane graphs. [Citation Graph (, )][DBLP]


  40. Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues [Citation Graph (, )][DBLP]


  41. Topological sweep of the complete graph. [Citation Graph (, )][DBLP]


  42. Tight Bounds for Connecting Sites Across Barriers. [Citation Graph (, )][DBLP]


  43. Cuttings for Disks and Axis-Aligned Rectangles in Three-Space. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.066secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002