425 search results - page 18 / 85 » Path Coloring on the Mesh |
112
click to vote
FSTTCS
2000
Springer
15 years 5 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
139
click to vote
SMA
2008
ACM
15 years 1 months ago
2008
ACM
This paper presents a computational method for converting a tetrahedral mesh to a prism-tetrahedral hybrid mesh for improved solution accuracy and computational efficiency of fini...
128
click to vote
CGF
1999
15 years 1 months ago
1999
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
136
click to vote
TOG
2012
13 years 4 months ago
2012
We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solv...
116
click to vote
JCO
2007
15 years 1 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...