Sciweavers

2183 search results - page 132 / 437
» Multi-pass geometric algorithms
Sort
View
ICCV
1995
IEEE
15 years 9 months ago
Geodesic Active Contours
A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the imag...
Vicent Caselles, Ron Kimmel, Guillermo Sapiro
SGP
2007
15 years 8 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
COMPGEOM
2006
ACM
16 years 4 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
SIGGRAPH
1993
ACM
15 years 10 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
3DIM
2007
IEEE
16 years 16 days ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...