401 search results - page 59 / 81 » Algorithms for a Simple Point Placement Problem |
131
click to vote
ICRA
2000
IEEE
15 years 9 months ago
2000
IEEE
Grasping a curved object free in the plane may be done through rolling a pair of fingers on the object’s boundary. Each finger is equipped with a tactile sensor able to record...
143
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
161
click to vote
IPMI
2009
Springer
15 years 11 months ago
2009
Springer
This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is r...
164
click to vote
SMA
2003
ACM
15 years 10 months ago
2003
ACM
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
191
click to vote
COMGEO
2006
ACM
15 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...