Related papers: Querying for the Largest Empty Geometric Object in…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
Let $P$ be a simple polygon with $n$ vertices, and let $A$ be a set of $m$ points or line segments inside $P$. We develop data structures that can efficiently count the number of objects from $A$ that are visible to a query point or a query…
An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…
In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
Given a finite set S in $[0,1]^2$ including the origin, an anchored rectangle packing is a set of non-overlapping rectangles in the unit square where each rectangle has a point of S as its left-bottom corner and contains no point of S in…
A set of rational points on a curve is said to be in geometric progression if either the abscissae or the ordinates of the points are in geometric progression. Examples of three points in geometric progression on a circle are already known.…
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can…
Geometric properties of the set of quantum entangled states are investigated. We propose an explicit method to compute the dimension of local orbits for any mixed state of the general K x M problem and characterize the set of effectively…
A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set $K$ having the same diameter as $K$ is called a completion of…
Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…
This is an extended version of an invited lecture I gave at the Journees Arithmetiques in St. Etienne in July 2009. We discuss the state of the art regarding the problem of finding the set of rational points on a (smooth projective)…
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
Searching for small objects in large images is a task that is both challenging for current deep learning systems and important in numerous real-world applications, such as remote sensing and medical imaging. Thorough scanning of very large…
By defining a fat point subscheme of $P^2$ to be a 0-dimensional subscheme defined by a sheaf of integrally closed ideals one extends the notion of fat point subschemes to allow infinitely near points. With this notion of fat points, this…
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
We explore inflectional morphology as an example of the relationship of the discrete and the continuous in linguistics. The grammar requests a form of a lexeme by specifying a set of feature values, which corresponds to a corner M of a…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…