Approximate symmetries of perturbed planar discrete curves

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43965145" target="_blank" >RIV/49777513:23520/22:43965145 - isvavai.cz</a>

Výsledek na webu

<a href="https://reader.elsevier.com/reader/sd/pii/S0167839622000516?token=4C5A7E8E4BBBACAB421CD095E3F575FE7B9706F65E18B4E18DBA835DB2E786F2D7DB2A81FB0A969957A5A96E4C9C3F20&originRegion=eu-west-1&originCreation=20220602112634" target="_blank" >https://reader.elsevier.com/reader/sd/pii/S0167839622000516?token=4C5A7E8E4BBBACAB421CD095E3F575FE7B9706F65E18B4E18DBA835DB2E786F2D7DB2A81FB0A969957A5A96E4C9C3F20&originRegion=eu-west-1&originCreation=20220602112634</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cagd.2022.102115" target="_blank" >10.1016/j.cagd.2022.102115</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Approximate symmetries of perturbed planar discrete curves

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Approximate symmetries of perturbed planar discrete curves

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/GF21-08009K" target="_blank" >GF21-08009K: Zobecněné symetrie a ekvivalence geometrických dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

COMPUTER AIDED GEOMETRIC DESIGN

ISSN

0167-8396

e-ISSN

1879-2332

Svazek periodika

96

Číslo periodika v rámci svazku

June

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

20

Strana od-do

nestrankovano

Kód UT WoS článku

000809910900001

EID výsledku v databázi Scopus

2-s2.0-85131400416