This paper$^{*}$ is devoted to a certain modification of the recently published method for an approximate reconstruction of inexact planar curves which are assumed to be perturbations of some unknown planar symmetric curves. The input curve is given by a perturbed polynomial and the reconstruction steps follow the results from the recently published papers on this topic. The functionality of the designed approach is presented on particular examples
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic ...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...
This paper$^{*}$ is devoted to a certain modification of the recently published method for an approx...
In this paper, we formulate a simple algorithm for an approximate reconstruction of an inexact plana...
In this paper, we formulate a simple algorithm for an approximate reconstruction of an inexact plana...
We present a new algorithm to decide whether a discrete curve is symmetric or not. In the affirmativ...
We present a new algorithm to decide whether a discrete curve is symmetric or not. In the affirmativ...
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebrai...
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebrai...
This paper is devoted to a problem from geometric modelling and related applications when exact symb...
This paper is devoted to a problem from geometric modelling and related applications when exact symb...
Given an algebraic curve in the complex affine plane, we describe how to determine all planar polyno...
This paper addresses the problem of determining the symmetries of a plane or space curve defined by ...
This paper addresses the problem of determining the symmetries of a plane or space curve defined by ...
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic ...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...
This paper$^{*}$ is devoted to a certain modification of the recently published method for an approx...
In this paper, we formulate a simple algorithm for an approximate reconstruction of an inexact plana...
In this paper, we formulate a simple algorithm for an approximate reconstruction of an inexact plana...
We present a new algorithm to decide whether a discrete curve is symmetric or not. In the affirmativ...
We present a new algorithm to decide whether a discrete curve is symmetric or not. In the affirmativ...
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebrai...
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebrai...
This paper is devoted to a problem from geometric modelling and related applications when exact symb...
This paper is devoted to a problem from geometric modelling and related applications when exact symb...
Given an algebraic curve in the complex affine plane, we describe how to determine all planar polyno...
This paper addresses the problem of determining the symmetries of a plane or space curve defined by ...
This paper addresses the problem of determining the symmetries of a plane or space curve defined by ...
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic ...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...
Finding a topologically accurate approximation of a real planar algebraic curve is a classic problem...