Diane L. Souvaine

According to our database1, Diane L. Souvaine authored at least 69 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2011, "For contributions to computational geometry and for service on behalf of the computing community.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2017
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2017

2016
The Flip Diameter of Rectangulations and Convex Subdivisions.
Discrete Mathematics & Theoretical Computer Science, 2016

Diffuse reflection diameter in simple polygons.
Discrete Applied Mathematics, 2016

2015
Isoperimetric Enclosures.
Graphs and Combinatorics, 2015

Bichromatic compatible matchings.
Comput. Geom., 2015

2014
The Flip Diameter of Rectangulations and Convex Subdivisions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

Diffuse Reflections in Simple Polygons.
Electronic Notes in Discrete Mathematics, 2013

Disjoint Compatible Geometric Matchings.
Discrete & Computational Geometry, 2013

Bounded-degree polyhedronization of point sets.
Comput. Geom., 2013

Algorithms for Designing Pop-Up Cards.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Bichromatic compatible matchings.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Hidden Mobile Guards in Simple Polygons.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Convex partitions with 2-edge connected dual graphs.
J. Comb. Optim., 2011

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three.
Algorithmica, 2011

Simultaneously Flippable Edges in Triangulations.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Disjoint compatible geometric matchings.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space.
Discrete & Computational Geometry, 2010

Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Bounded-degree polyhedronization of point sets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
A vertex-face assignment for plane graphs.
Comput. Geom., 2009

Compatible geometric matchings.
Comput. Geom., 2009

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues.
Natural Computing, 2008

Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics, 2008

Tight Bounds for Connecting Sites Across Barriers.
Discrete & Computational Geometry, 2008

Topological sweep of the complete graph.
Discrete Applied Mathematics, 2008

Data Structures for Restricted Triangular Range Searching.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Efficient Many-To-Many Point Matching in One Dimension.
Graphs and Combinatorics, 2007

Cuttings for Disks and Axis-Aligned Rectangles.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Deflating the Pentagon.
Proceedings of the Computational Geometry and Graph Theory, 2007

Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Tight bounds for connecting sites across barriers.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Computing the Tool Path of an Externally Monotone Polygon in Linear Time.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

An Experimental Study of Old and New Depth Measures.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom., 2005

Hinged Dissection of Polypolyhedra.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

A vertex-face assignment for plane graphs.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Transformations and algorithms for least sum of squares hypersphere fitting.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Efficient computation of location depth contours by methods of computational geometry.
Statistics and Computing, 2003

Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case.
Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

Planar minimally rigid graphs and pseudo-triangulations.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Constructing differentiable homeomorphisms between isomorphic triangulations.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Topological Sweep in Degenerate Cases.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Fast implementation of depth contours using topological sweep.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1997
The Floodlight Problem.
Int. J. Comput. Geometry Appl., 1997

Testing Simple Polygons.
Comput. Geom., 1997

Constructing piecewise linear homeomorphisms of polygons with holes.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1995
An Efficient Algorithm for Guard Placement in Polygons with Holes.
Discrete & Computational Geometry, 1995

Combinatorial Complexity of Signed Discs.
Comput. Geom., 1995

1994
Clamping a polygon.
The Visual Computer, 1994

1993
On Compatible Triangulations of Simple Polygons.
Comput. Geom., 1993

Combinatorial Complexity of Signed Discs (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

The Floodlight Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Testing Simple Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions.
SIAM J. Comput., 1992

Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Detecting the intersection of convex objects in the plane.
Computer Aided Geometric Design, 1991

The Aquarium Keeper's Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Computational Geometry in a Curved World.
Algorithmica, 1990

On Solving Geometric Optimization Problems Using Shortest Paths.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1988
Decomposition and Intersection of Simple Splinegons.
Algorithmica, 1988


  Loading...