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
CITATION STYLE
Eppstein, D. (2010). Regular Labelings and Geometric Structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6506 LNCS, p. 1). Springer Verlag. https://doi.org/10.1007/978-3-642-17517-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
