Sciweavers

2081 search results - page 67 / 417
» L-systems in Geometric Modeling
Sort
View
PRICAI
2004
Springer
14 years 3 months ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
COMPGEOM
2003
ACM
14 years 3 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ECCV
2002
Springer
15 years 3 days ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
ICPR
2002
IEEE
14 years 11 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...