Abstract
We present a new algorithm to decide whether a discrete curve is symmetric or not. In the affirmative case we assign to each curve a particular symmetry group, and describe all rotational and reflectional symmetries (if they exist). The fundamental strategy of our approach is to decompose the given curve into a collection of appropriate components (simpler discrete curves) whose symmetries can be found more easily. The symmetries of the original curve are then derived from the symmetries of these individual components. Subsequently, we show that the formulated approach can be suitably modified to the situation when the input discrete curve is perturbed. Then we determine the approximate symmetries. The functionality of the proposed method is illustrated by several examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.