1728 search results - page 50 / 346 » Surface distance maps |
142
click to vote
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R2 to a...
118
click to vote
SMA
2006
ACM
15 years 8 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
102
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
145
click to vote
CGF
2011
14 years 5 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
135
click to vote
SIAMIS
2010
15 years 10 days ago
2010
Surface registration, which transforms different sets of surface data into one common reference space, is an important process which allows us to compare or integrate the surface ...