2021/06/28 by Sujoy Bhore, Prosenjit Bose, Bhore, Sujoy +7
Computer Science · Environmental Science · #05C10 #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #F.2 #FOS: Computer and information sciences #G.2 #Remote Sensing and LiDAR Applications
paper · pdf · doi:10.48550/arxiv.2106.14451
openalex publication_date 2021/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A realizer, commonly known as Schnyder woods, of a triangulation is a partition of its interior edges into three oriented rooted trees. A flip in a realizer is a local operation that transforms one realizer into another. Two types of flips in a realizer have been introduced: colored flips and cycle flips. A corresponding flip graph is defined for each of these two types of flips. The vertex sets are the realizers, and two realizers are adjacent if they can be transformed into each other by one flip. In this paper we study the relation between these two types of flips and their corresponding flip graphs. We show that a cycle flip can be obtained from linearly many colored flips. We also prove an upper bound of O(n2) on the diameter of the flip graph of realizers defined by colored flips. In addition, a data structure is given to dynamically maintain a realizer over a sequence of colored flips which supports queries, including getting a node's barycentric coordinates, in O(log n) time per flip or query.