| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10327471 | Computational Geometry | 2005 | 11 Pages |
Abstract
In this paper, we prove that any plane graph G has a VR with width at most â13nâ249â, which can be constructed by using the simple standard VR algorithm in [P. Rosenstiehl, R.E. Tarjan, Discrete Comput. Geom. 1 (1986) 343-353; R. Tamassia, I.G. Tollis, Discrete Comput. Geom. 1 (1986) 321-341].
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Huaming Zhang, Xin He,