Geometric tree matching with applications to 3D lung structures

Chandrasekhar Pisupati, Lawrence Wolff, Wayne Mitzner, Elias Zerhouni

Research output: Contribution to conferencePaper

Abstract

An efficient algorithm is presented for the rooted binary tree isomorphism problem under the operation of graph minors (restricted version). This algorithm relies on one-to-one matching of nodes T1 and T2 based not only on the topology but also relies on the heuristics. Maximum relaxation bounds on these geometric parameters are estimated. Due to very few candidate nodes that satisfy these criteria, the algorithm worked well.

Original languageEnglish (US)
PagesC-19-C-20
StatePublished - Jan 1 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996

Other

OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period5/24/965/26/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Geometric tree matching with applications to 3D lung structures'. Together they form a unique fingerprint.

  • Cite this

    Pisupati, C., Wolff, L., Mitzner, W., & Zerhouni, E. (1996). Geometric tree matching with applications to 3D lung structures. C-19-C-20. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .