140 search results - page 13 / 28 » Computing the visibility graph of points within a polygon |
96
Voted
ACIVS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
105
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
145
click to vote
USS
2010
14 years 9 months ago
2010
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
112
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...