70 search results - page 5 / 14 » Edge foci interest points |
APVIS
2007
14 years 11 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
TALG
2008
14 years 9 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
79
Voted
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
A novel method for extracting parametric junction and corner features in images is presented. By treating each complex feature as a combination of elementary line and edge feature...
92
Voted
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...