Sciweavers

2843 search results - page 42 / 569
» Interpolation by geometric algorithm
Sort
View
ECCV
2002
Springer
14 years 11 months 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
IJCAI
2003
13 years 11 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
COMPGEOM
2009
ACM
14 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
JNW
2007
104views more  JNW 2007»
13 years 9 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
CAD
2005
Springer
13 years 9 months ago
Geometric algorithms for rapidly reconfigurable mold manufacturing of free-form objects
This paper presents geometric algorithms for developing a re-configurable tooling system for fabrication of freeform objects. The proposed method involves a mold block, with n fac...
Aditya Kelkar, Rakesh Nagi, Bahattin Koc