Related papers: Approximate Parametrization of Space Algebraic Cur…
We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of…
Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has…
Let K be a field of characteristic zero, alpha algebraic of degree n over K. Given a proper parametrization psi of a rational curve C, we present a new algorithm to compute the hypercircle associated to the parametrization psi. As a…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
We show how to specify preferred parameterisations on a homogeneous curve in an arbitrary homogeneous space. We apply these results to limit the natural parameters on distinguished curves in parabolic geometries.
Optimization problems over discrete or quantized variables are very challenging in general due to the combinatorial nature of their search space. Piecewise-affine regularization (PAR) provides a flexible modeling and computational framework…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
This paper is devoted to the study of unparameterized simple curves in the plane. We propose diverse canonical parameterizations of a 2D-curve. For instance, the arc-length parameterization is canonical, but we consider other natural…
We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
An important operation in geometry processing is finding the correspondences between pairs of shapes. The Gromov-Hausdorff distance, a measure of dissimilarity between metric spaces, has been found to be highly useful for nonrigid shape…
A novel static algorithm is proposed for numerical reparametrization of periodic planar curves. The method identifies a monitor function of the arclength variable with the true curvature of an open planar curve and considers a simple…
Reachability analysis is a formal method to guarantee safety of dynamical systems under the influence of uncertainties. A substantial bottleneck of all reachability algorithms is the necessity to adequately tune specific algorithm…
We study algebraic relations among postcritically finite (PCF) parameters in the family $f_c(z) = z^2 + c$. Ghioca, Krieger, Nguyen and Ye proved that an algebraic curve in $\mathbb{C}^2$ contains infinitely many PCF pairs $(c_1, c_2)$ if…
We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most…
The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
In this article we address the problem of computing the dimension of the space of plane curves of degree $d$ with $n$ general points of multiplicity $m$. A conjecture of Harbourne and Hirschowitz implies that when $d \geq 3m$, the dimension…
The primary goal of this paper is to complete the theory of metric Diophantine approximation initially developed in [Ann. of Math.(2) 166 (2007), p.367-426] for $C^3$ non-degenerate planar curves. With this goal in mind, here for the first…
In the presence of a positive, compactly supported measure on an affine algebraic curve, we relate the density of polynomials in Lebesgue $L^2$-space to the existence of analytic bounded point evaluations. Analogues to the complex plane…