425 search results - page 41 / 85 » Path Coloring on the Mesh |
111
click to vote
PG
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents several methods for shading meshes from scanned paint samples that represent dark to light transitions. Our techniques emphasize artistic control of brush stro...
AICT
2006
IEEE
15 years 8 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
110
click to vote
WG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
146
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. ...
VISUALIZATION
2005
IEEE
15 years 7 months ago
2005
IEEE
While previous Visualization panels have focused on different methods for scientific visualization, this panel focuses on the process of transforming data into insight. The overa...