Related papers: Self-overlapping Curves Revisited

We construct embedded minimal surfaces which are $n$-periodic in $\mathbb{R}^n$. They are new for codimension $n-2\ge 2$. We start with a Jordan curve of edges of the $n$-dimensional cube. It bounds a Plateau minimal disk which Schwarz…

Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete…

I present a way to visualize the concept of curved spacetime. The result is a curved surface with local coordinate systems (Minkowski Systems) living on it, giving the local directions of space and time. Relative to these systems, special…

Consider the scheme parametrizing non-constant morphisms from a fixed projective curve to a projective surface. There is a rational map between this scheme and the Chow variety of $1$-cycles on the surface. We prove that, if the curve is…

We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…

Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve has attracted much interest. In the present paper, we propose a new method to construct a surface…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

The geometric Cauchy problem for a class of surfaces in a pseudo-Riemannian manifold of dimension 3 is to find the surface which contains a given curve with a prescribed tangent bundle along the curve. We consider this problem for constant…

We develop a Morse-Lusternik-Schnirelmann theory for the distance between two points of a smoothly embedded circle in a complete Riemannian manifold. This theory suggests very naturally a definition of width that generalises the classical…

Suppose a smooth planar curve $\gamma$ is $2\pi$-periodic in the $x$ direction and the length of one period is $\ell$. It is shown that if $\gamma$ self-intersects, then it has a segment of length $\ell- 2\pi$ on which it self-intersects…

We discuss the boundary of the spacetime region through each point of which a trapped surface passes, first in some simple soluble examples, and then in the self-similar Vaidya solution. For the latter the boundary must lie strictly inside…

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…

We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…

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…

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…

In this article, we study subloci of solvable curves in $\mathcal{M}_g$ which are contained in either a K3-surface or a quadric or a cubic surface. We give a bound on the dimension of such subloci. In the case of complete intersection genus…

The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…