Related papers: Intersection numbers in the curve complex via subs…
Modern time series analysis requires the ability to handle datasets that are inherently high-dimensional; examples include applications in climatology, where measurements from numerous sensors must be taken into account, or inventory…
We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…
We present a novel, deterministic, and efficient method to detect whether a given rational space curve is symmetric. By using well-known differential invariants of space curves, namely the curvature and torsion, the method is significantly…
We bound the genus of a projective curve lying on a complete intersection surface in terms of its degree and the degrees of the defining equations of the surface on which it lies.
Consider two paths $\phi,\psi:[0;1]\to [0;1]^2$ in the unit square such that $\phi(0)=(0,0)$, $\phi(1)=(1,1)$, $\psi(0)=(0,1)$ and $\psi(1)=(1,0)$. By continuity of $\phi$ and $\psi$ there is a point of intersection. We prove that from…
Intersection detection between three-dimensional bodies has various applications in computer graphics, video game development, robotics as well as military industries. In some respects, entities do not want to disclose sensitive information…
We present a condition number of the intersection of two B\'ezier curves.
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
${\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…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We introduce a special class of supersingular curves over $\mathbb{F}_{p^2}$, characterized by the existence of non-integer endomorphisms of small degree. A number of properties of this set is proved. Most notably, we show that when this…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
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…
Given a specific collection of curves on an oriented surface with punctures, we associate a power series by counting its intersections with multicurves. This paper presents a reciprocity formula on the power series when multicurves with no…
We establish an arithmetic intersection theory in the framework of Arakelov geometry over adelic curves. To each projective scheme over an adelic curve, we associate a multi-homogenous form on the group of adelic Cartier divisors, which can…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…