Problem
Research questions and friction points this paper is trying to address.
Analyze resolution bounds in planar drawings
Generalize Tutte's algorithm for maximal graphs
Evaluate Floater-Gotsman morphing algorithm's output resolution
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
🤖 AI Summary
This work systematically investigates the analytic and geometric feasibility of orthogonal embeddings and continuous morphs of planar graphs. Addressing the Floater algorithm and the Floater–Gotsman morphing framework, it establishes, for the first time, necessary and sufficient combinatorial conditions for the solvability of planar orthogonal embeddings, unifying Tutte embeddings, Floater morphs, and Gotsman morphs into a single theoretical framework. Leveraging harmonic mapping analysis, linear programming modeling, and barycentric interpolation, the paper proves that every 3-connected planar graph admits a crossing-free orthogonal embedding and constructs an O(n)-time-computable convexity-preserving morph sequence. Furthermore, it reveals an intrinsic mechanism whereby polynomial-resolution input embeddings may degenerate to exponential-resolution outputs under morphing, and derives tight bounds on resolution deterioration. These results provide rigorous theoretical guarantees and efficient algorithmic foundations for dynamic graph visualization.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Generalized Tutte's algorithm
Analyzed Floater-Gotsman morphs
Proved exponential resolution bounds
🔎 Similar Papers
No similar papers found.
