Related papers: Closing curves by rearranging arcs
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
We introduce a novel energy method that reinterprets ``curve shortening'' as ``tangent aligning''. This conceptual shift enables the variational study of infinite-length curves evolving by the curve shortening flow, as well as higher order…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
We obtain a sharp bound on the number of self-intersections of a closed planar curve with trigonometric parameterization. Moreover, we show that a generic curve of this form is normal in the sense of Whitney.
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
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…
Reassembling 3D broken objects is a challenging task. A robust solution that generalizes well must deal with diverse patterns associated with different types of broken objects. We propose a method that tackles the pairwise assembly of 3D…
Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.
We prove that curve shortening flow on the round sphere displays sharp chord-arc improvement, precisely as in the planar setting (Andrews and Bryan, Comm. Anal. Geom., 2011). As in the planar case, the sharp estimate implies control on the…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
In this paper we present a method for extraction of arcs of the algebraic curves of the higher order. Method is applied on conics, Cartesian ovals, trifocal curves and generalized Weber's curve.
The `linear orbit' of a plane curve of degree $d$ is its orbit in $\P^{d(d+3)/2}$ under the natural action of $\PGL(3)$. In this paper we obtain an algorithm computing the degree of the closure of the linear orbit of an arbitrary plane…
The writhe of a space curve fragment is considered for various boundary conditions. An expression for the writhe as a function of arclength for an arbitrary space curve is obtained. The formula is built on the base of closing the tangent…
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for…
This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…
We show that there are five types of planar curves such that arrangements of its translates are combinatorially equivalent to an arrangement of lines. These curves can be used to define norms giving constructions with many unit distances…
As in our previous work [1] we address the problem to determine the splitting of the normal bundle of rational curves. With apolarity theory we are able to characterize some particular subvarieties in some Hilbert scheme of rational curves,…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…