Embedding the Dual Complex of Hyper-rectangular Partitions

Kerber, Michael

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

Embedding the Dual Complex of Hyper-rectangular Partitions

MPS-Authors

/persons/resource/persons44759

Kerber, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:1207.3202.pdf
(Preprint), 369KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Kerber, M. (2013). Embedding the Dual Complex of Hyper-rectangular Partitions. Retrieved from http://arxiv.org/abs/1207.3202.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-476A-3

Abstract

A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each dual vertex is placed into the rectangle that it represents. We show that deciding whether such a drawing exists is NP-complete. Moreover, we consider the drawing where a vertex is placed in the center of the represented rectangle and consider sufficient conditions for this drawing to be nice. This question is studied both in the plane and for the higher-dimensional generalization of rectangular partitions.