Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CCCG
2010

favoriteEmaildiscussreport

145views Computational Geometry» more CCCG 2010»

Regular labelings and geometric structures

13 years 6 months ago

Regular labelings and geometric structures

Download www.cs.umanitoba.ca

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.

David Eppstein

Real-time Traffic

CCCG 2010 | Computational Geometry | Efficient Geometric Algorithms | Near-maximal Planar Graph | Rectangular Subdivisions |

claim paper

Related Content

» Semisupervised discriminant analysis based on UDP regularization

» Laplacian Regularized DOptimal Design for Active Learning and Its Application to Image Ret...

» Manifold Regularization A Geometric Framework for Learning from Labeled and Unlabeled Exam...

» GOptimal Design with Laplacian Regularization

» SemiSupervised Learning Based on Semiparametric Regularization

» Transfer Learning with Graph CoRegularization

» On exploiting hierarchical label structure with pairwise classifiers

» Geometric Context from a Single Image

» Discovering structural regularity in 3D geometry

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	David Eppstein

Comments (0)