Name
Abstract | ||
|---|---|---|
We first describe two stochastic algorithms which build trees in high dimensional Euclidean spaces with some adaptation to the geometry of a chosen target subset. The second one produces search trees and is used to approximately identify in real time the pose of a polyhedron from its external contour. A search tree is first grown in a space of shapes of plane curves which are a set of precomputed polygonal outlines of the polyhedron. The tree is then used to find in real time a best match to the outline of the polyhedron in the current pose. Analyzing the deformation of the curves along the tree thus built, shows progressive differentiation from a simple convex root shape to the various possible external contours, and the tree organizes the complex set of shapes into a more comprehensible object. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11577812_14 | DSSCV |
Keywords | Field | DocType |
best match,complex set,search tree,various possible external contour,high dimensional euclidean space,external contour,chosen target subset,comprehensible object,real time,adaptive tree,plane curve,euclidean space | Polygon,Computer science,Polyhedron,Algorithm,Euclidean space,Regular polygon,Plane curve,Euclidean geometry,Binary search tree,Search tree | Conference |
Volume | ISSN | ISBN |
3753 | 0302-9743 | 3-540-29836-3 |
Citations | PageRank | References |
1 | 0.48 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yannick L. Kergosien | 1 | 5 | 1.38 |