6393 search results - page 194 / 1279 » Randomized Algorithms on the Mesh |
111
click to vote
MICCAI
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
114
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
129
click to vote
FOCS
1996
IEEE
15 years 8 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
123
click to vote
CCCG
2010
15 years 5 months ago
2010
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
149
click to vote
CG
2005
Springer
15 years 4 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...