Related papers: Bezier Curves Intersection Using Relief Perspectiv…
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…
Recent investigations on the bifurcations in switching circuits have shown that many atypical bifurcations can occur in piecewise smooth maps which can not be classified among the generic cases like saddle-node, pitchfork or Hopf…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…
In this paper, we give several simple methods for drawing a whole rational surface (without base points) as several Bezier patches. The first two methods apply to surfaces specified by triangular control nets and partition the real…
The goal of the paper is to study the angle between two curves in the framework of metric (and metric measure) spaces. More precisely, we give a new notion of angle between two curves in a metric space. Such a notion has a natural interplay…
In this paper we report some important results that help in analizing the border collision bifurcations that occur in n-dimensional discontinuous maps. For this purpose, we use the piecewise linear approximation in the neighborhood of the…
This paper is concerned with the computation of an optimal matching between two manifold-valued curves. Curves are seen as elements of an infinite-dimensional manifold and compared using a Riemannian metric that is invariant under the…
First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.
Understanding complex scenarios from in-vehicle cameras is essential for safely operating autonomous driving systems in densely populated areas. Among these, intersection areas are one of the most critical as they concentrate a considerable…
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and…
Optimization over the intersection of two manifolds arises in a broad range of applications, but is hindered by the coupled geometry of the feasible region. In this paper, we prove that the regularities -- clean intersection and intrinsic…
The paper focuses on synthesizing optimal contact curves that can be used to ensure a rolling constraint between two bodies in relative motion. We show that geodesic based contact curves generated on both the contacting surfaces are…
Bezout's theorem gives us the degree of intersection of two properly intersecting projective varieties. As two curves in P^3 never intersect properly, Bezout's theorem cannot be directly used to bound the number of intersection points of…
The conjugate locus of a point $p$ in a surface $\mathcal{S}$ will have a certain number of cusps. As the point $p$ is moved in the surface the conjugate locus may spontaneously gain or lose cusps. In this paper we explain this…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
We propose to determine the bifurcation diagrams of fixed points using their coordinates as control parameters. This method can lead to exact solutions to otherwise intractable bifurcation problems.
Road boundaries, or curbs, provide autonomous vehicles with essential information when interpreting road scenes and generating behaviour plans. Although curbs convey important information, they are difficult to detect in complex urban…
We determine the precise bifurcation diagrams of the apparent contours of generic crosscaps, which contain the information of bifurcations with respect to the images of the singular sets of crosscaps: crosscap points and double point…