Sciweavers

1633 search results - page 98 / 327
» Planar Map Graphs
Sort
View
RT
2001
Springer
14 years 2 months ago
Opacity Shadow Maps
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
Tae-Yong Kim 0002, Ulrich Neumann
ADCM
2006
133views more  ADCM 2006»
13 years 10 months ago
Convex combination maps over triangulations, tilings, and tetrahedral meshes
: In a recent paper by the first author, a simple proof was given of a result by Tutte on the validity of barycentric mappings, recast in terms of the injectivity of piecewise line...
Michael S. Floater, Valérie Pham-Trong
RECOMB
2010
Springer
14 years 3 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
ICIP
2002
IEEE
14 years 12 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie
FSTTCS
2009
Springer
14 years 4 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...