| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10335920 | Computers & Graphics | 2011 | 13 Pages |
Abstract
⺠Grahams algorithm can be extended to liver trees ⺠Globally optimal tree matching is robust under noise and topological deformations ⺠Runtime is significantly reduced by preselecting a few matches ⺠Interactive refinement using visual features simplifies detection and correction.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Cristina Oyarzun Laura, Klaus Drechsler,