The following pages link to Diane L. Souvaine (Q299066):
Displaying 50 items.
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- (Q924078) (redirect page) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues (Q941687) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- A vertex-face assignment for plane graphs (Q1025293) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- (Q1346128) (redirect page) (← links)
- An efficient algorithm for guard placement in polygons with holes (Q1346129) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Combinatorial complexity of signed discs (Q1917033) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- On compatible triangulations of simple polygons (Q2367126) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Testing simple polygons. (Q2482903) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- (Q2768366) (← links)
- Constrained Tri-Connected Planar Straight Line Graphs (Q2849798) (← links)
- Algorithms for Designing Pop-Up Cards (Q2957890) (← links)
- The Flip Diameter of Rectangulations and Convex Subdivisions (Q2965976) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Coverage with k-Transmitters in the Presence of Obstacles (Q3066439) (← links)
- (Q3138983) (← links)
- Computing Least Median of Squares Regression Lines and Guided Topological Sweep (Q3481105) (← links)
- (Q3601570) (← links)
- Cuttings for Disks and Axis-Aligned Rectangles (Q3603550) (← links)
- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs (Q3652277) (← links)
- Time- and Space-Efficient Algorithms for Least Median of Squares Regression (Q3771429) (← links)
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions (Q4016400) (← links)
- The Floodlight Problem (Q4340965) (← links)
- (Q4707797) (← links)
- Simultaneously Flippable Edges in Triangulations (Q4899272) (← links)
- Combinatorial complexity of signed discs (Q5060148) (← links)
- (Q5088936) (← links)
- Bichromatic compatible matchings (Q5174487) (← links)
- (Q5290310) (← links)
- Compatible Geometric Matchings (Q5301007) (← links)
- Deflating the Pentagon (Q5302738) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q5361619) (← links)
- Algorithms and Data Structures (Q5394251) (← links)
