Related papers: Closing curves by rearranging arcs
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…
We find a geometrical method of analysing the singularities of a plane nodal curve. The main results will be used in a forthcoming paper on geometric Plucker formulas for such curves. Plane nodal curves, that is plane curves having at most…
In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
Reconstructing 3D scenes from multiple views has made impressive strides in recent years, chiefly by correlating isolated feature points, intensity patterns, or curvilinear structures. In the general setting - without controlled…
Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle given in terms of the exponential of Gaussian Free Field. We conjecture that our curves are locally…
We present an algorithm for constructing a map $\mathbb{P}^2\to\mathbb{P}^2$ with a given branching curve. The stepping stone is the ramification curve, which is obtained as the linear normalization of the branching curve.
Reconstructing the missing parts of a curve has been the subject of much computational research, with applications in image inpainting, object synthesis, etc. Different approaches for solving that problem are typically based on processes…
In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in $\mathbb{R}^{2}$. The main idea is to smooth the parametrization of the curve by…
While self-similar sets have no tangents at any single point, self-affine curves can be smooth. We consider plane self-affine curves without double points and with two pieces. There is an open subset of parameter space for which the curve…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
A k-outerplanar graph is a graph that can be drawn in the plane without crossing such that after k-fold removal of the vertices on the outer-face there are no vertices left. In this paper, we study how to triangulate a k-outerplanar graph…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…