Related papers: Visualizing Planar and Space Implicit Real Algebra…
Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…
Scene understanding from images is a challenging problem encountered in autonomous driving. On the object level, while 2D methods have gradually evolved from computing simple bounding boxes to delivering finer grained results like instance…
Recent techniques have been successful in reconstructing surfaces as level sets of learned functions (such as signed distance fields) parameterized by deep neural networks. Many of these methods, however, learn only closed surfaces and are…
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…
We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…
We describe a technique for bundled curve representations in parallel-coordinates plots and present a controlled user study evaluating their effectiveness. Replacing the traditional C^0 polygonal lines by C^1 continuous piecewise Bezier…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
Learning a latent embedding to understand the underlying nature of data distribution is often formulated in Euclidean spaces with zero curvature. However, the success of the geometry constraints, posed in the embedding space, indicates that…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
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…
We propose a data-driven space-filling curve method for 2D and 3D visualization. Our flexible curve traverses the data elements in the spatial domain in a way that the resulting linearization better preserves features in space compared to…
We study how an irreducible closed algebraic curve X embedded in CP^3 can be recovered using its projections from points onto embedded projective planes. The different embeddings are unknown. The only input is the defining equation of each…
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…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…
We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum,…