Regular Labelings and Geometric Structures
Computational Geometry
2010-07-02 v1 Combinatorics
Abstract
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an associated maximal or near-maximal planar graph. We briefly survey the connections and analogies between these three kinds of labelings, and their uses in designing efficient geometric algorithms.
Cite
@article{arxiv.1007.0221,
title = {Regular Labelings and Geometric Structures},
author = {David Eppstein},
journal= {arXiv preprint arXiv:1007.0221},
year = {2010}
}
Comments
6 pages, 3 figures. Invited to the 22nd Canadian Conference on Computational Geometry (CCCG 2010)