Exact and approximate symmetries of discrete curves in plane
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43966429" target="_blank" >RIV/49777513:23520/22:43966429 - isvavai.cz</a>
Result on the web
<a href="http://csgg2022.upol.cz/files/gcg_2022-online.pdf" target="_blank" >http://csgg2022.upol.cz/files/gcg_2022-online.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Exact and approximate symmetries of discrete curves in plane
Original language description
Recently, a new algorithm to decide whether a discrete curve is symmetric or not was published. The basic strategy is to decompose a given curve into a family of suitable components (simpler discrete curves) whose symmetries can be found more easily. Using the designed method all existing rotational and reflectional symmetries can be determined. The formulated approach can be easily modified for perturbed discrete curves for which approximate symmetries are to be computed. In this contribution we shortly recall main steps of the algorithm from Bizzarri, Lávička, Vršek (CAGD, 2022).
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
<a href="/en/project/GF21-08009K" target="_blank" >GF21-08009K: Generalized Symmetries and Equivalences of Geometric Data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů