Related papers: Self-overlapping Curves Revisited

We provide criteria 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. These criteria reduce the projection problem to a certain…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

This paper focuses on intersection of closed curves on translation surfaces. Namely, we investigate the question of determining the intersection of two closed curves of a given length on such surfaces. This question has been investigated in…

In this paper, we establish a second main theorem for holomorphic curve intersecting hypersurfaces in general position in projective space with level of truncation. As an application, we reduce the number hypersurfaces in uniqueness problem…

Let S be a compact surface with boundary and F be the set of the orbits of a traversing flow on S. If the flow is generic, its orbit space is a spine G of S, namely G is a graph embedded in S and S is a regular neighbourhood of G. Moreover…

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is…

We prove several interpolation results for holomorphic Legendrian curves lying in an odd dimensional complex Euclidean space with the standard contact structure. In particular, we show that an arbitrary countable set of points in…

In the realm of computer-aided design (CAD) software, the intersection of B-spline surfaces stands as a fundamental operation. Despite the extensive history of surface intersection algorithms, the challenge of handling complex intersection…

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

We study the geometric and combinatorial effect of smoothing an intersection point in a collection of arcs or curves on a surface. We prove that all taut arcs with fixed endpoints and all taut 1-manifolds with at least two non-disjoint…

We study area- and length-preserving curvature flows for embedded closed curves on pinched Hadamard surfaces. In the variable-curvature setting, the evolution equations contain additional lower-order terms, so the PDE analysis requires…

We consider an open, bounded, simply connected (Lipschitz) domain in $\mathbb{R}^d$, which contains a closed polyhedral surface or polygonal contour, referred to as the interface. From this interface, forces are exerted in the normal…

In this paper, we consider rational cuspidal plane curves having at least three cusps. We give an upper bound of the self-intersection number of the proper transforms of such curves via the minimal embedded resolution of the cusps. For a…

The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…

We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…