2010/07/01 by David Eppstein, Eppstein, David
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #cs.CG #math.CO
paper · pdf · doi:10.48550/arxiv.1007.0221
6 pages, 3 figures. Invited to the 22nd Canadian Conference on Computational Geometry (CCCG 2010)
arxiv created 2010/07/01 · arxiv updated 2010/07/02
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.