Related papers: Asymmetric Convex Intersection Testing
The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…
The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…
The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are…
In the first part of this thesis, we consider an instance of Frechet distance problem in which the speed of traversal along each segment of the curves is restricted to be within a specfied range. This setting is more realistic than the…
We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…
In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
Optical navigation on a CubeSat must rely on the best extraction of the directions of some beacons from on-board images. We present an experiment on OPS-SAT, a CubeSat of the European Space Agency (ESA), that will characterize an onboard…
This paper proposes an algorithm for clipping line segment against an axis-aligned rectangular window. The conventional algorithms for line segment clipping treat the clipping boundary and/or the line segment to be clipped as line. The…
Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…
Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for…
Let $C\subset\mathbb{R}^2$ be a convex body, and for a positive integer $N$, let $\mathcal{P}$ be a configuration of $N$ points in $[0,1)^2$. The discrepancy of $\mathcal{P}$ with respect to $C$ is defined by \begin{equation*}…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
We present an algorithmic framework for computing anti-chains of maximum size in geometric posets. Specifically, posets in which the entities are geometric objects, where comparability of two entities is implicitly defined but can be…