1348 search results - page 2 / 270 » Matching planar maps |
WABI
2007
Springer
13 years 11 months ago
2007
Springer
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
ICPR
2000
IEEE
14 years 6 months ago
2000
IEEE
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
WG
2004
Springer
13 years 10 months ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
ISBI
2006
IEEE
14 years 5 months ago
2006
IEEE
Nonlinear registration of 3D surfaces is important in many medical imaging applications, including the mapping of longitudinal changes in anatomy, or of multi-subject functional M...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...