Sciweavers

23 search results - page 3 / 5
» Polychromatic colorings of plane graphs
Sort
View
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 16 days ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
DAM
2006
124views more  DAM 2006»
13 years 5 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
GMP
2010
IEEE
354views Solid Modeling» more  GMP 2010»
13 years 6 months ago
Automatic Generation of Riemann Surface Meshes
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
Matthias Nieser, Konstantin Poelke, Konrad Polthie...
CVPR
2003
IEEE
14 years 7 months ago
Stereo Matching with Reflections and Translucency
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 5 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas