Search results
Results From The WOW.Com Content Network
Pebble motion problems occur in domains such as multi-robot motion planning (in which the pebbles are robots) and network routing (in which the pebbles are packets of data). The best-known example of a pebble motion problem is the famous 15 puzzle where a disordered group of fifteen tiles must be rearranged within a 4x4 grid by sliding one tile ...
PDF version of the chart. The colors of the chart were described by McCamy et al. with colorimetric measurements using the CIE 1931 2° standard observer and Illuminant C, and also in terms of the Munsell color system. Using measured reflectance spectra, it is possible to derive CIELAB coordinates for Illuminants D 65 and D 50 and coordinates ...
The twelve pentominoes. After an introductory chapter that enumerates the polyominoes up to the hexominoes (made from six squares), the next two chapters of the book concern the pentominoes (made from five squares), the rectangular shapes that can be formed from them, and the subsets of an chessboard into which the twelve pentominoes can be packed.
The sheen [4] or gloss level of a paint is principally determined by the ratio of resinous, adhesive binder, which solidifies after drying, and solid, powdery pigment.The more binder the coating contains, the more regular reflection will be made from its smooth surface; conversely, with less binder, grains of pigment become exposed to the surface, scattering the light and providing matte ...
The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3]: ND22, ND23
The Fechner color effect is an illusion of color seen when looking at certain rapidly changing or moving black-and-white patterns. They are also called pattern induced flicker colors (PIFCs). A sample of a Benham's top (animated version) The effect is most commonly demonstrated with a device known as Benham's top (also called Benham's disk ...
The problem of finding equitable colorings with as few colors as possible (below the Hajnal-Szemerédi bound) has also been studied. A straightforward reduction from graph coloring to equitable coloring may be proven by adding sufficiently many isolated vertices to a graph, showing that it is NP-complete to test whether a graph has an equitable ...
The goal remains to place a black pebble on the target vertex, but the pebbling of adjacent vertices may be done with pebbles of either color. Takumi Kasai et al. developed a game in which a pebble may be moved along an edge-arrow to an unoccupied vertex only if a second pebble is located at a third, control vertex; the goal is to move a pebble ...