Yi-Jun Chang - Ortho-Radial Drawing in Near-Linear Time

theoretics:13409 - TheoretiCS, April 8, 2025, Volume 4 - https://doi.org/10.46298/theoretics.25.11
Ortho-Radial Drawing in Near-Linear TimeArticle

Authors: Yi-Jun Chang ORCID

    An orthogonal drawing is an embedding of a plane graph into a grid. In a seminal work of Tamassia (SIAM Journal on Computing 1987), a simple combinatorial characterization of angle assignments that can be realized as bend-free orthogonal drawings was established, thereby allowing an orthogonal drawing to be described combinatorially by listing the angles of all corners. The characterization reduces the need to consider certain geometric aspects, such as edge lengths and vertex coordinates, and simplifies the task of graph drawing algorithm design. Barth, Niedermann, Rutter, and Wolf (SoCG 2017) established an analogous combinatorial characterization for ortho-radial drawings, which are a generalization of orthogonal drawings to cylindrical grids. The proof of the characterization is existential and does not result in an efficient algorithm. Niedermann, Rutter, and Wolf (SoCG 2019) later addressed this issue by developing quadratic-time algorithms for both testing the realizability of a given angle assignment as an ortho-radial drawing without bends and constructing such a drawing. In this paper, we further improve the time complexity of these tasks to near-linear time. We establish a new characterization for ortho-radial drawings based on the concept of a good sequence. Using the new characterization, we design a simple greedy algorithm for constructing ortho-radial drawings.


    Volume: Volume 4
    Published on: April 8, 2025
    Accepted on: February 27, 2025
    Submitted on: April 16, 2024
    Keywords: Computer Science - Computational Geometry,Computer Science - Data Structures and Algorithms

    Consultation statistics

    This page has been seen 58 times.
    This article's PDF has been downloaded 25 times.