作者: Stefan Carlsson
DOI: 10.1007/BF00058751
关键词:
摘要: An algorithm is presented for computing a decomposition of planar shapes into convex subparts represented by ellipses. The method invariant to projective transformations the shape, and thus ellipses can be used matching definition invariants in same way as points lines. works arbitrary admitting at least four distinct tangents based on finding with contact given shape. cross ratio computed from ellipse then projectively index. For each pair compute two independent invariants. set indexes hash table which model hypothesis generated. >