Results 1  10
of
409,262
Coloring squares of planar graphs with girth six
 SUBMITTED TO EUROPEAN JOURNAL OF COMBINATORICS
"... Wang and Lih conjectured that for every g ≥ 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree ∆ ≥ M(g) is (∆+1)colorable. The conjecture is known to be true for g ≥ 7 but false for g ∈ {5, 6}. We show that the conjecture for g = 6 is off ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Wang and Lih conjectured that for every g ≥ 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree ∆ ≥ M(g) is (∆+1)colorable. The conjecture is known to be true for g ≥ 7 but false for g ∈ {5, 6}. We show that the conjecture for g = 6 is off
Least Squares Conformal Maps for Automatic Texture Atlas Generation
, 2002
"... A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, and the unfolded charts are packed in texture space. Existing texture atlas methods for triangulated surfaces suffer from ..."
Abstract

Cited by 320 (6 self)
 Add to MetaCart
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, and the unfolded charts are packed in texture space. Existing texture atlas methods for triangulated surfaces suffer from
Geometry images
 IN PROC. 29TH SIGGRAPH
, 2002
"... Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create onl ..."
Abstract

Cited by 342 (24 self)
 Add to MetaCart
simple 2D array of quantized points. Surface signals like normals and colors are stored in similar 2D arrays using the same implicit surface parametrization — texture coordinates are absent. To create a geometry image, we cut an arbitrary mesh along a network of edge paths, and parametrize the resulting
Bayesian color constancy
 Journal of the Optical Society of America A
, 1997
"... The problem of color constancy may be solved if we can recover the physical properties of illuminants and surfaces from photosensor responses. We consider this problem within the framework of Bayesian decision theory. First, we model the relation among illuminants, surfaces, and photosensor response ..."
Abstract

Cited by 185 (23 self)
 Add to MetaCart
The problem of color constancy may be solved if we can recover the physical properties of illuminants and surfaces from photosensor responses. We consider this problem within the framework of Bayesian decision theory. First, we model the relation among illuminants, surfaces, and photosensor
Color plane interpolation using alternating projections
 IEEE Trans. Image Processing
, 2002
"... Abstract—Most commercial digital cameras use color filter arrays to sample red, green, and blue colors according to a specific pattern. At the location of each pixel only one color sample is taken, and the values of the other colors must be interpolated using neighboring samples. This color plane in ..."
Abstract

Cited by 176 (5 self)
 Add to MetaCart
in an alternatingprojections scheme. We have compared this technique with six stateoftheart demosaicing techniques, and it outperforms all of them, both visually and in terms of mean square error. Index Terms—Bayer pattern, color filter array, demosaicing, POCS. I.
On colorings of squares of outerplanar graphs
 Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms
, 2004
"... We study vertex colorings of the square G 2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G 2 as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the listchr ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We study vertex colorings of the square G 2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G 2 as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list
Squarefree colorings of graphs
"... Let G be a graph and let c be a coloring of its edges. If the sequence of colors along a walk of G is of the form a1,..., an, a1,..., an, the walk is called a square walk. We say that the coloring c is squarefree if any open walk is not a square and call the minimum number of colors needed so that ..."
Abstract
 Add to MetaCart
Let G be a graph and let c be a coloring of its edges. If the sequence of colors along a walk of G is of the form a1,..., an, a1,..., an, the walk is called a square walk. We say that the coloring c is squarefree if any open walk is not a square and call the minimum number of colors needed so
Results 1  10
of
409,262