We study the problem of construction of a convex 3-polytope whose (i) shadow boundary has n vertices and (ii) two hulls, upper and lower, are isomorphic to two given triangulations of a convex n-gon. Barnette [℄ D. W. Barnette. Projections of 3-polytopes. Israel J. Math., 8:304{308, 1970] proved the existence of a convex 3-polytope in general...
-
March 1, 2017 (v1)PublicationUploaded on: March 27, 2023
-
April 8, 2024 (v1)Publication
A set of n drones with limited communication range is deployed to monitor a terrain partitioned into pairwise disjoint and closed convex trajectories, one per drone. There is exactly one communication link between two trajectories if they are close enough, and drones can communicate provided they visit the link at the same time. If each robot...
Uploaded on: April 4, 2025 -
August 10, 2018 (v1)Publication
An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets.We present an efficient O(n log3...
Uploaded on: March 27, 2023 -
August 9, 2018 (v1)Publication
In this paper we study the following problem: Given sets R and B of r red and b blue points respectively in the plane, find a minimum-cardinality set H of axis-aligned rectangles (boxes) so that every point in B is covered by at least one rectangle of H, and no rectangle of H contains a point of R. We prove the NP-hardness of the stated...
Uploaded on: March 27, 2023 -
February 12, 2016 (v1)Publication
No description
Uploaded on: March 27, 2023 -
May 19, 2017 (v1)Publication
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed such a drawing in the grid [1, c ·n 3/2]2 for some constant c > 0, and showed that this grid size is optimal up to a constant factor. We consider the analogous problem of drawing the double circle, and prove that it can be...
Uploaded on: March 26, 2023 -
May 18, 2017 (v1)Publication
Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a stationary rotating floodlight with illumination angle α, initially oriented in a suitable direction, in such a way that, at...
Uploaded on: December 5, 2022