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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 27:2; číslo Combinatorics; s. 1 - 31
Hlavní autori:	Di Battista, Giuseppe, Frati, Fabrizio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!