Related papers: Symplectifying Biarcs
In this article, circular arcs are considered both individually and as elements of a piecewise circular curve. The endpoint parameterization proves to be quite advantageous here. The perspective of symplectic geometry provides new vectorial…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…
This gives some information about the conformal point and the calibrating conic, and their relationship one to the other. These concepts are useful for visualizing image geometry, and lead to intuitive ways to compute geometry, such as…
The mathematical theory underlying Hamiltonian mechanics is called symplectic geometry. So symplectic geometry arose from the roots of mechanics and is seen as one of the most valuable links between physics and mathematics today. Symplectic…
This is a survey on symplectic birational geometry. In arbitrary dimension, this subject is centered around the notion of uniruledness. In low dimensions, we will also discuss Kodaira dimension and minimality.
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
For a given triangle $\triangle ABC$, we define two sequences of points on line $BC$ and provide their generalizations to real functions such that centers of circumscribed circles around $A$ and adjacent points in subsequences generate a…
In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…
The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…
A new geometric procedure to construct symplectic methods for constrained mechanical systems is developed in this paper. The definition of a map coming from the notion of retraction maps allows to adapt the continuous problem to the…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
An efficient way to get implicit equations of conics on five points and quadrics on nine, using pencils of conics and quadrics, is revealed. Parallel axis right cones intersect on a conic. An example, to show how to place five coplanar…
It is shown here how prior estimates on the local shape of the universe can be used to reduce, to a small region, the full parameter space for the search of circles in the sky. This is the first step towards the development of efficient…
An arc in $\Z^2_n$ is defined to be a set of points no three of which are collinear. We describe some properties of arcs and determine the maximum size of arcs for some small $n$.
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
In this article, we present two new characterizations of circular-arc bigraphs based on their vertex ordering. Also, we provide a characterization of circular-arc bigraphs in terms of forbidden patterns with respect to a particular ordering…