Affiliation:
1. Department of Computer Science, Utrecht University, Padualaan 14, 3584 CH Utrecht, The Netherlands
Abstract
In this paper we present a linear time and space algorithm for constructing a visibility representation of a planar graph on an [Formula: see text] grid, thereby improving the previous bound of (2n-5)×(n-1). To this end we build in linear time the 4-block tree of a planar graph, which improves previous time bounds. Moreover, this is the first time that the technique of splitting a graph into its 4-connected components is used successfully in graph drawing
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献