From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms. In this paper, focusing on maximal plane graphs, we prove upper and lower bounds on...
Saved in:
| Main Authors: | Giuseppe Di Battista, Fabrizio Frati |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2025-03-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/12439/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
A new discrete theory of pseudoconvexity
by: Balázs Keszegh
Published: (2023-05-01) -
Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
by: Julian Gutierrez, et al.
Published: (2024-12-01) -
Distinct Angles and Angle Chains in Three Dimensions
by: Ruben Ascoli, et al.
Published: (2023-02-01) -
On the parameterized complexity of computing tree-partitions
by: Hans L. Bodlaender, et al.
Published: (2025-02-01)