Affiliation:
1. AT&T Labs, Florham Park, NJ
2. University of Utah, Salt Lake City, UT
Abstract
Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding
rectangular layouts
is a key problem. We study the area-optimization problem and show that it is NP-hard to find a minimum-area rectangular layout of a given contact graph. We present
O
(
n
)-time algorithms that construct
O
(
n
2
)-area rectangular layouts for general contact graphs and
O
(
n
log
n
)-area rectangular layouts for trees. (For trees, this is an
O
(log
n
)-approximation algorithm.) We also present an infinite family of graphs (respectively, trees) that require Ω(
n
2
) (respectively, Ω(
n
log
n
))area.
We derive these results by presenting a new characterization of graphs that admit rectangular layouts, using the related concept of
rectangular duals
. A corollary to our results relates the class of graphs that admit rectangular layouts to
rectangle-of-influence drawings
.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference57 articles.
1. ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME
2. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading MA. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading MA.
3. Andreev E. M. 1970a. On convex polyhedra in Lobachevski spaces. Mat. ∼Spornik 81 123 445--478. Andreev E. M. 1970a. On convex polyhedra in Lobachevski spaces. Mat. ∼Spornik 81 123 445--478.
4. A linear algorithm to find a rectangular dual of a planar triangulated graph
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献