Related papers: Developing methods for identifying the inflection …
We study closed smooth convex plane curves $\Gamma$ enjoying the following property: a pair of points $x,y$ can traverse $\Gamma$ so that the distances between $x$ and $y$ along the curve and in the ambient plane do not change; such curves…
In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…
3D point clouds deep learning is a promising field of research that allows a neural network to learn features of point clouds directly, making it a robust tool for solving 3D scene understanding tasks. While recent works show that point…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We consider the problem of convergence to a saddle point of a concave-convex function via gradient dynamics. Since first introduced by Arrow, Hurwicz and Uzawa in [1] such dynamics have been extensively used in diverse areas, there are,…
The equichordal point problem is a classical question in geometry, asking whether there exist multiple equichordal points within a single convex body. An equichordal point is defined as a point through which all chords of the convex body…
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$…
A curve has the increasing chord property if for any points $a,b,c,d$ in this order on the curve, the distance of $a,d$ is not smaller than that of $b,c$. Answering a conjecture of Larman and McMullen, Rote proved in 1994 that the arclength…
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 investigate the behaviour of vertices and inflexions on 1-parameter families of curves on smooth surfaces in the 3-space, which include a singular member. In particular, we discuss the context where the curves evolve as sections of a…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
With the ubiquity of sensors in the IoT era, statistical observations are becoming increasingly available in the form of massive (multivariate) time-series. Formulated as unsupervised anomaly detection tasks, an abundance of applications…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact…
Given a real hyperelliptic algebraic curve $X$ with non-empty real part and a real effective divisor $\mc{D}$ arising via pullback from $\mathbb{P}^1$ under the hyperelliptic structure map, we study the real inflection points of the…
A recent result shows that a general smooth plane quartic can be recovered from its 24 inflection lines and a single inflection point. Nevertheless, the question whether or not a smooth plane curve of degree at least 4 is determined by its…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
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…