scientific article; zbMATH DE number 1445367

MaRDI QIDQ4952689zbMATH OpenFDO

Authors Srikanta Tirthapura, Daniel Sharvit, Ben Kimia, Philip N. Klein

Publication date 10 May 2000

zbMATH Keywords

shapestree edit-distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shape matching using edit-distance: An implementation
• Distance measures for embedded graphs
• Matching planar maps
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 2079389

Cited in

(15)

• Dissimilarity between two skeletal trees in a context
• Qualitative geometry for shape recognition
• A new matching algorithm between trees of shapes and its application to brain tumor segmentation
• Shape matching using edit-distance: An implementation
• Fast Algorithms for Computing Tree LCS
• A metric normalization of tree edit distance
• Edit distance between unrooted trees in cubic time
• A survey on tree edit distance and related problems
• Scale Space and PDE Methods in Computer Vision
• On the hardness of computing the edit distance of shallow trees
• Faster algorithms for bounded tree edit distance
• Fast algorithms for computing tree LCS
• Faster algorithm for bounded tree edit distance in the low-distance regime
• Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
• Comparing trees via crossing minimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952689)