1348 search results - page 48 / 270 » Matching planar maps |
ICPR
2000
IEEE
14 years 2 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
GD
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
SEMWEB
2007
Springer
14 years 4 months ago
2007
Springer
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
TMI
2010
13 years 4 months ago
2010
Abstract--Doppler echocardiography remains the most extended clinical modality for the evaluation of left ventricular (LV) function. Current Doppler ultrasound methods, however, ar...