Symmetries of discrete curves and point clouds via trigonometric interpolation
From MaRDI portal
Publication:2668041
Abstract: We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the symmetry group of the obtained trigonometric curve. The algorithm exploits the fact that the introduced unique assigning of the trigonometric curve to each closed discrete curve commutes with isometries. For understandable reasons, an essential part of the paper is devoted to determining rotational and axial symmetries of trigonometric curves. We also show that the formulated approach can be easily applied on nonorganized clouds of points. A functionality of the designed detection method is presented on several examples.
Recommendations
- Approximate symmetries of perturbed planar discrete curves
- Approximate symmetries of planar algebraic curves with inexact input
- Symmetry detection of rational space curves from their curvature and torsion
- Detecting symmetries of rational plane and space curves
- Efficient detection of symmetries of polynomially parametrized curves
Cites work
- A cyclic basis for closed curve and surface modeling
- A sampler of useful computational tools for applied geometry, computer graphics, and image processing
- Affine equivalences of trigonometric curves
- Algorithms for trigonometric curves (simplification, implicitization, parameterization)
- Approximate symmetries of planar algebraic curves with inexact input
- Computing projective equivalences of special algebraic varieties
- Congruence, similarity, and symmetries of geometric objects
- Detecting similarity of rational plane curves
- Detecting symmetries of rational plane and space curves
- Efficient detection of symmetries of polynomially parametrized curves
- Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors
- scientific article; zbMATH DE number 1881986 (Why is no real title available?)
- Optimal algorithms for symmetry detection in two and three dimensions
- Projective and affine symmetries and equivalences of rational curves in arbitrary dimension
- Rotations, translations and symmetry detection for complexified curves
- Similarity detection of rational space curves
- Symmetries and similarities of planar algebraic curves using harmonic polynomials
- Symmetry detection in 3D chain coded discrete curves and trees
- Testing congruence and symmetry for general 3-dimensional objects.
- The universe of conics. From the ancient Greeks to 21st century developments
Cited in
(9)- Detecting affine equivalences between implicit planar algebraic curves
- Approximate symmetries of perturbed planar discrete curves
- Algorithms for testing axial symmetry of structured point clouds
- Computing symmetries of implicit algebraic surfaces
- Symmetries of planar algebraic vector fields
- Symmetry group detection of point clouds in 3D via a decomposition method
- Computing affine equivalences and symmetries of trigonometric curves in arbitrary dimension
- Rotational symmetries of 3D point clouds using the covariance matrix and higher-order tensors
- Approximate affine equivalences of polynomial and trigonometric curves
This page was built for publication: Symmetries of discrete curves and point clouds via trigonometric interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668041)
