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...

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 27:2; no. Combinatorics; pp. 1 - 31
Main Authors:	Di Battista, Giuseppe, Frati, Fabrizio
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Subjects:	Algorithms Computer science computer science - computational geometry computer science - data structures and algorithms computer science - discrete mathematics Graph theory Graphs Lower bounds Mathematical research Morphing Polynomials Italy
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!