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) -
Current Open Problems in Discrete and Computational Geometry
by: H. Edelsbrunner, et al.
Published: (2015-03-01) -
The First Yaroslavl Summer School on Discrete and Computational Geometry
by: Nikolay Dolbilin, et al.
Published: (2015-02-01) -
Yaroslavl International Conference on Discrete Geometry (dedicated to the centenary of A. D. Alexandrov)
by: N. Dolbilin, et al.
Published: (2015-03-01) -
ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INTERSECTING A STRAIGHT LINE
by: Daniel M. Khachay, et al.
Published: (2016-12-01)