Related papers: Equal Aperture Angles Curve for some Convex Sets i…
We prove that every polynomially convex arc is contained in a polynomially convex simple closed curve. We also establish results about polynomial hulls of arcs and curves that are locally rectifiable outside a polynomially convex subset.
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
Let $C$ be a generic complex plane plane curve with a given Newton polygon $P$. We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve $C^\vee$). We also prove…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.…
We present an algorithm which, given a deformation with trivial section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the mu-constant stratum in characteristic 0) in the parameter space…
The main goal of this paper is to give a general method to compute (via computer algebra systems) an explicit set of generators of the ideals of the projective embeddings of some ruled surfaces, namely projective line bundles over curves…
We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…
In this article we study surfaces in $\mathbb{S}^3(1) \times \mathbb{R}$ for which the $\mathbb{R}$-direction makes a constant angle with the normal plane. We give a complete classification for such surfaces with parallel mean curvature…
In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…
Geometric constructions are widely used in computer graphics and engineering drawing. A right generalized cylinder is a ruled surface whose base curve is a plane curve perpendicular to the rulings. The paper discusses relations between the…
I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve.…
We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…
We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…
The article reviews some of the (fairly scattered) information available in the mathematical literature on the subject of angles in complex vector spaces. The following angles and their relations are considered: Euclidean, complex, and…
Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
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 consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
In this paper, tangent-, principal normal-, and binormal-wise associated curves are defined such that each of these vectors of any given curve lies on the osculating, normal, and rectifying plane of its mate, respectively. For each…