Related papers: Realization of abstract convex geometries by point…
Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…
This article belongs to the area of geometric tomography, which is the study of geometric properties of solids based on data about their sections and projections. We describe a new direction in geometric tomography where different…
In this paper, is introduced a new proposal of resolvent for equilibrium problems in terms of the Busemann's function. A great advantage of this new proposal is that, in addition to be a natural extension of the proposal in the linear…
We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
Generalized entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
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…
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex…
A geometrical formulation for adjoint-symmetries as 1-forms is studied for general partial differential equations (PDEs), which provides a dual counterpart of the geometrical meaning of symmetries as tangent vector fields on the solution…
Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will…
Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact 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 work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
In this paper we study how certain symmetries of convex bodies affect their geometric properties. In particular, we consider the impact of symmetries generated by the block diagonal subgroup of orthogonal transformations, generalizing…