Abstract

We provide an algorithm to detect whether two bounded, planar parametrized curves are similar, i.e. whether there exists a similarity transforming one of the curves onto the other. The algorithm is valid for completely general parametrizations, and can be adapted to the case when the input is given with finite precision, using the notion of approximate [Formula: see text]. The algorithm is based on the computation of centers of gravity and inertia tensors of the considered curves or of the planar regions enclosed by the curves, which have nice properties when a similarity transformation is applied. In more detail, the centers of gravity are mapped onto each other, and the matrices representing the inertia tensors satisfy a simple relationship: when the similarity is a congruence (i.e. distances are preserved) the matrices are congruent, and in the more general case the relationship is analogous, but involves the square of the scaling constant. Using both properties, and except for certain pathological cases, the similarities can be found. Additional ideas are presented for the case of closed, i.e. compact, curves.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.