Approximate symmetries of perturbed planar discrete curves
A discrete curve \(\mathcal{C}\) in \(\mathbb{R}^2\) is a finite set of vertices connected by line segments such that each vertex has only two neighbours. As the authors explain in the abstract, the main goal of this paper is to study (approximate) symmetries of discrete curves. Thus, a new algorithm to decide whether a discrete curve is symmetric or not is introduced. In the affirmative case, rotational and reflectional symmetries (if they exist) are described. The approach is to decompose the given curve into simpler discrete curves whose symmetries can be obtained more easily, and to derive the symmetries of the original curve from those of the components. Furthermore, they show that this method, suitably adapted, can also be used for perturbations of discrete curves, subsequently determining the approximate symmetries. Finally, several examples illustrating the method are also included.
- Approximate symmetries of planar algebraic curves with inexact input
- An analysis of symmetry for plane curves and plane curve algorithms
- Symmetries and similarities of planar algebraic curves using harmonic polynomials
- Symmetrization of convex plane curves
- scientific article; zbMATH DE number 1271212
- scientific article; zbMATH DE number 1912111
- Detecting symmetries of rational plane and space curves
- Symmetries of analytic curves
- scientific article; zbMATH DE number 4142322
- Symmetry detection of rational space curves from their curvature and torsion
- A sampler of useful computational tools for applied geometry, computer graphics, and image processing
- Curves and Surfaces for Computer Graphics
- Detecting symmetries in polynomial Bézier curves
- Detecting symmetries of rational plane and space curves
- Efficient detection of symmetries of polynomially parametrized curves
- scientific article; zbMATH DE number 194260 (Why is no real title available?)
- Projective and affine symmetries and equivalences of rational and polynomial surfaces
- Projective and affine symmetries and equivalences of rational curves in arbitrary dimension
- Rotations, translations and symmetry detection for complexified curves
- Symmetries and similarities of planar algebraic curves using harmonic polynomials
- Symmetries of discrete curves and point clouds via trigonometric interpolation
- Testing congruence and symmetry for general 3-dimensional objects.
- An analysis of symmetry for plane curves and plane curve algorithms
- Symmetry maps of free-form curve segments via wave propagation
- Approximate symmetries of planar algebraic curves with inexact input
- Symmetries of discrete curves and point clouds via trigonometric interpolation
- Symmetry group detection of point clouds in 3D via a decomposition method
- Rotational symmetries of 3D point clouds using the covariance matrix and higher-order tensors
- Approximate symmetry detection in noisy 3D data
- Approximate affine equivalences of polynomial and trigonometric curves
This page was built for publication: Approximate symmetries of perturbed planar discrete curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154247)
