Related papers: Area Problems Involving Kasner Polygons
The sum of elliptic integrals simultaneously determines orbits in thr Kepler problem and the addition of divisors on elliptic curves. Periodic motion of a body in physical space is defined by symmetries, whereas periodic motion of divisors…
Every regular polygon can be regarded as a member of a well-defined 'family' of related regular polygons. These families arise naturally in the study of piecewise rotations such as outer billiards. In some cases they exist on all scales and…
We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There has been a fair amount of work for this problem when the rectangles have to be axis-aligned or when the polygon is convex. We consider this…
In the standard planar $k$-center clustering problem, one is given a set $P$ of $n$ points in the plane, and the goal is to select $k$ center points, so as to minimize the maximum distance over points in $P$ to their nearest center. Here we…
The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…
We provide general inequalities that compare the surface area S(K) of a convex body K in ${\mathbb R}^n$ to the minimal, average or maximal surface area of its hyperplane or lower dimensional projections. We discuss the same questions for…
A graph is $k$-connected if it has $k$ internally-disjoint paths between every pair of nodes. A subset $S$ of nodes in a graph $G$ is a $k$-connected set if the subgraph $G[S]$ induced by $S$ is $k$-connected; $S$ is an $m$-dominating set…
Given $n$ line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\varepsilon$, for any $\varepsilon>0$, to obtain a simple polygon? While the…
A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and~$q$. We study geometric…
In the present paper, a new type of mappings called perimetric contractions on $k$-polygons is introduced. These contractions can be viewed as a generalization of mappings that contracts perimeters of triangles. A fixed point theorem for…
In this paper, we establish coincidence-like results in the case when the values of the correspondences are not convex. In order to do this, we define a new type of correspondences, namely properly quasi-convex-like. Further, we apply the…
This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
This paper deals with elliptic equations in the plane with degeneracies. The equations are generated by a complex vector field that is elliptic everywhere except along a simple closed curve. Kernels for these equations are constructed.…
It was shown in [11] that for every origin-symmetric star body $K \subseteq \mathbb R^n$ of volume $1$, every even continuous probability density $f$ on $K$ and $1 \leq k \leq n-1$, there exists a subspace $F \subseteq \mathbb R^n$ of…
This paper provides the first solution to the kinetic reverse $k$-nearest neighbor (\rknn) problem in $\mathbb{R}^d$, which is defined as follows: Given a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer $k$,…