6 citations · 13 across the 4 of their papers we have counts for
4 papers
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
George Rabanca, Ivo Vigan
We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximati…
Packing and Covering a Polygon with Geodesic Disks
Ivo Vigan
Given a polygon , for two points and contained in the polygon, their \emph{geodesic distance} is the length of the shortest -path within . A \emph{geodesic disk}…
Point Set Isolation Using Unit Disks is NP-complete
Rainer Penninger, Ivo Vigan
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subse…
On Separating Families of Bipartitions
Takahisa Toda, Ivo Vigan
In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set…