Drawing outerplanar minimum weight triangulations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A New Heuristic for Minimum Weight Triangulation
- A note on Delaunay and optimal triangulations
- Algorithms for drawing graphs: An annotated bibliography
- Computing a subgraph of the minimum weight triangulation
- Computing the minimum weight triangulation of a set of linearly ordered points
- Graph theory
- Minimal Triangulations of Polygonal Domains
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- New results for the minimum weight triangulation problem
- On approximation behavior of the greedy triangulation for convex polygons
- The greedy and Delaunay triangulations are not bad in the average case
- Triangulations intersect nicely
Cited in
(9)- The weighted barycenter drawing recognition problem
- Triangulations without minimum-weight drawing
- scientific article; zbMATH DE number 2080112 (Why is no real title available?)
- scientific article; zbMATH DE number 1629854 (Why is no real title available?)
- Voronoi drawings of trees
- Minimum weight pseudo-triangulations
- Maximum weight triangulation and graph drawing
- Algorithms and Computation
- The drawability problem for minimum weight triangulations
This page was built for publication: Drawing outerplanar minimum weight triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351606)