Related papers: Plane $R$-paths and their rectifiability property
We study branched covers of curves with specified ramification points, under a notion of equivalence derived from linear series. In characteristic 0, no non-constant families of covers with fixed ramification points exist. In positive…
When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…
From a topological viewpoint, a rational curve in the real projective plane is generically a smoothly immersed circle and a finite collection of isolated points. We give an isotopy classification of generic rational quintics in…
We obtain the list of automorphism groups for smooth plane sextic curves over an algebraically closed field K of characteristic p=0 or p>21. Moreover, we assign to each group a geometrically complete family over K describing its…
Let f_t , where t is close to zero, be an analytic family of plane-to-plane mappings. There are presented effective methods of computing the number of cusps of f_t emanating from the origin and having positive/negative cusp degree.
Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but this topic has not been studied thoroughly. Often,…
A recent result shows that a general smooth plane quartic can be recovered from its 24 inflection lines and a single inflection point. Nevertheless, the question whether or not a smooth plane curve of degree at least 4 is determined by its…
Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…
We show that the length of a path in $ \mathbf{R}^2 $ can be computed if and only if its variation in every direction can.
The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.
A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
A plane curve is called strange if its tangent line at any smooth point passes through a fixed point, called the strange point. In this paper, we study $\mathbb{A}^1$-curves on the complement of a rational strange curve of degree $p$ in…
In the plane, we study the transform $R_\gamma f$ of integrating a unknown function $f$ over circles centered at a given curve $\gamma$. This is a simplified model of SAR, when the radar is not directed but has other applications, like…
Given a set $S$ of elements in a number field $k$, we discuss the existence of planar algebraic curves over $k$ which possess rational points whose $x$-coordinates are exactly the elements of $S$. If the size $|S|$ of $S$ is either $4,5$,…
We study rectangles inscribed in lines in the plane by parametrizing these rectangles in two ways, one involving slope and the other aspect ratio. This produces two paths, one that finds rectangles with specified slope and the other…
In this paper, we study the curvature properties of random complex plane curves. We bound from below the probability that a uniform proportion of the area of a random complex degree $d$ plane curve has a curvature smaller than $-d/8$. Our…
This paper presents a family of new methods for locating/fitting hyperplanes with respect to a given set of points. We introduce a general framework for a family of aggregation criteria of different distance-based errors. The most popular…
This paper presents a game-theoretic path-following formulation where the opponent is an adversary road model. This formulation allows us to compute safe sets using tools from viability theory, that can be used as terminal constraints in an…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…