Diane Souvaine | Academic Influence

Diane Souvaine's AcademicInfluence.com Rankings

Diane Souvaine

Computer Science

#4506

World Rank

#4753

Historical Rank

#1463

USA Rank

computer-science Degrees

Diane Souvaine

Mathematics

#5380

World Rank

#7576

Historical Rank

#1772

USA Rank

Geometry

#176

World Rank

#251

Historical Rank

#33

USA Rank

Measure Theory

#4600

World Rank

#5384

Historical Rank

#1275

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Diane Souvaine's Degrees

PhD Computer Science Princeton University
Masters Computer Science Princeton University
Bachelors Mathematics City College of New York

Similar Degrees You Can Earn

Why Is Diane Souvaine Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Diane L. Souvaine is a professor of computer science and an adjunct professor of mathematics at Tufts University. Contributions Souvaine's research is in computational geometry and its applications, including robust non-parametric statistics and molecular modeling. She has also encouraged women and minorities to study and pursue careers in mathematics and the sciences and advocated gender neutrality in science teaching.

(See a Problem?)

Diane Souvaine's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On Compatible Triangulations of Simple Polygons (1993) (114)
Planar minimally rigid graphs and pseudo-triangulations (2003) (113)
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues (2008) (102)
Computing Least Median of Squares Regression Lines and Guided Topological Sweep (1990) (90)
Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, May 14-16, 2003 (2006) (69)
An efficient algorithm for guard placement in polygons with holes (1995) (65)
Time- and Space-Efficient Algorithms for Least Median of Squares Regression (1987) (63)
Efficient computation of location depth contours by methods of computational geometry (2003) (63)
Computational geometry in a curved world (1990) (56)
The Floodlight Problem (1997) (54)
Compatible geometric matchings (2007) (48)
An Experimental Study of Old and New Depth Measures (2006) (39)
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions (1992) (39)
An intuitive approach to measuring protein surface curvature (2005) (38)
The Aquarium Keeper's Problem (1991) (36)
Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes (1992) (36)
Fast implementation of depth contours using topological sweep (2001) (35)
Disjoint Compatible Geometric Matchings (2011) (32)
Efficient Many-To-Many Point Matching in One Dimension (2007) (27)
Topological Sweep in Degenerate Cases (2002) (27)
Hinged Dissection of Polypolyhedra (2005) (27)
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues (2007) (22)
Decomposition and intersection of simple splinegons (1988) (22)
Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case (2003) (21)
On solving geometric optimization problems using shortest paths (1990) (20)
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three (2011) (20)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Bichromatic compatible matchings (2012) (19)
Constructing piecewise linear homeomorphisms of polygons with holes (1997) (19)
Convexifying Polygons Without Losing Visibilities (2011) (18)
Constructing piecewise linear homeomorphisms (1994) (15)
Detecting the intersection of convex objects in the plane (1991) (15)
Computational Geometry and Statistical Depth Measures (2004) (14)
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs (2009) (12)
A vertex-face assignment for plane graphs (2009) (11)
Computational geometry in a curved world (algorithm) (1986) (11)
Testing Simple Polygons (1997) (10)
Dynamic Maintenance of Half-Space Depth for Points and Contours (2011) (9)
Simultaneously Flippable Edges in Triangulations (2011) (9)
Convex partitions with 2-edge connected dual graphs (2009) (9)
Algorithms for Designing Pop-Up Cards (2013) (9)
Face guards for art galleries (2011) (8)
Constrained Tri-Connected Planar Straight Line Graphs (2013) (8)
Transformations and algorithms for least sum of squares hypersphere fitting (2004) (6)
Data Structures for Restricted Triangular Range Searching (2008) (6)
Hidden Mobile Guards in Simple Polygons (2012) (6)
Depth Explorer — A Software Tool for Analysis of Depth Measures (2006) (6)
The contour problem for restricted-orientation polygons (1992) (5)
Tight Bounds for Connecting Sites Across Barriers (2006) (5)
Circumscribing Polygons and Polygonizations for Disjoint Line Segments (2019) (5)
Proximity graph depth , depth contours , and a new multimodal median ∗ (2005) (5)
Curves in the Sand: Algorithmic Drawing (2006) (5)
Localizing an object with finger probes (1995) (4)
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification (2005) (4)
The Flip Diameter of Rectangulations and Convex Subdivisions (2013) (4)
Topological sweep of the complete graph (2008) (4)
Separating bi-chromatic points by parallel lines (1990) (4)
Reconfiguration of connected graph partitions (2019) (3)
Dynamic Update of Half-space Depth Contours (2004) (3)
Bounded-degree polyhedronization of point sets (2010) (3)
How Hard Can It Be to Draw a Pie Chart (1990) (3)
Algorithms and analysis of depth functions using computational geometry (2005) (2)
Deflating the Pentagon (2008) (2)
Efficient Radio Wave Front Propagation for Wireless Radio Signal Prediction1 (1999) (2)
Reconfiguration of Connected Graph Partitions via Recombination (2020) (2)
Diffuse Reflections in Simple Polygons (2013) (2)
Dynamic Ham-Sandwich Cuts for Two Point Sets with Bounded Convex-Hull-Peeling Depth (2005) (2)
Model for mentoring and retaining engineering students from underrepresented groups (2004) (2)
Connecting Obstacles in Vertex-Disjoint Paths (2010) (2)
Combinatorial Complexity of Signed Discs (1995) (2)
Describing Multivariate Distributions with Nonlinear Variation Using Data Depth (2006) (2)
Computing the Tool Path of an Externally Monotone Polygon in Linear Time (2006) (1)
Automating Software Documentation (1998) (1)
Clamping a polygon (1994) (1)
Higher Dimensional Convex Hull Algorithms (2006) (1)
Diffuse reflection diameter in simple polygons (2013) (1)
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001 (2001) (1)
Experimental Results on Upper Bounds for Vertex Pi-Lights ∗ (2001) (1)
Universality Results for Pop-Ups (2011) (1)
Constructing differentiable homeomorphisms between isomorphic triangulations (2002) (1)
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (2016) (1)
Cuttings for Disks and Axis-Aligned Rectangles (2007) (0)
Diane L. Souvaine: Beyond Complacency: Renewing America's Endless Frontier (2020) (0)
Isoperimetric Enclosures (2015) (0)
Visibility Graph with Multiple Reflection and its Application of Wireless Communication Design (2018) (0)
The Contour Problem for (1992) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)
Dynamic Ham-Sandwich Cuts for Two Overlapping Point Sets (2006) (0)
Isoperimetric Enclosures (2015) (0)
Constructing Dierentiable Homeomorphisms between Isomorphic (2007) (0)
Combinatorial Complexity of Signed Discs (Extended Abstract) (1993) (0)
Disjoint Compatible Geometric Matchings (2012) (0)
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space (2010) (0)
1 Combinatorial Complexity of Signed Discs (2018) (0)
Localizing an object with nger probes (2006) (0)
C O ] 2 5 Ju l 2 00 3 Planar Minimally Rigid Graphs and Pseudo-Triangulations (2019) (0)
Topologically Sweeping the Complete Graph in Optimal Time (0)
Mexican Conference on Discrete Mathematics and Computational Geometry Isoperimetric Enclosures (2014) (0)
Tile Self-Assembly Simulations (2012) (0)

This paper list is powered by the following services:

Other Resources About Diane Souvaine

en.wikipedia.org

What Schools Are Affiliated With Diane Souvaine?

Diane Souvaine is affiliated with the following schools:

Image Attributions

Image Source for Diane Souvaine