Triangulations without minimum-weight drawing
From MaRDI portal
Publication:294766
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A new subgraph of minimum weight triangulations
- Algorithms for drawing graphs: An annotated bibliography
- Computing a subgraph of the minimum weight triangulation
- Drawing outerplanar minimum weight triangulations
- Maximum weight triangulation and graph drawing
- Toughness and Delaunay triangulations
Cited in
(7)- Polynomial area bounds for MST embeddings of trees
- 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
- A note on isosceles planar graph drawing
- Algorithms and Computation
- The drawability problem for minimum weight triangulations
This page was built for publication: Triangulations without minimum-weight drawing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294766)