In this paper, we investigate the L1 geodesic farthest neighbors in a simple polygon P , and address several fundamental problems related to farthest neighbors. Given a subset S ⊆ P , an L1 geodesic farthest neighbor of p ∈ P from S is one that maximizes the length of L1 shortest path from p in P . Our list of problems include: computing the diameter, radius, center, farthestneighbor Voronoi di...

Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...

Suppose there are k types of facilities, e. g. schools, post offices, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location is in having at least one representative of each facility type in the neighborhood. In this paper we provide algorithms that may help to achieve this goal for various specifications of the term “...

! " # %$ & #' )(* +, ( *. # $/( #0 213 4 " #65/ )( 7986 $. /$ : %(* ; % ;% %$ % " =<> %(* ? @ A B$ ;% # 7DC E F % $ , =$ ;% GIH KJ L@ @ M F# 4 F F = N $ % : ;%(* # /+O #, P$ * ) Q # $ % * L@ + ) SR9 # * ) * ) ) ( #0 -T % </ ) $0 B $. ' * % U + 1V ;% * )(* W P ) # (* % * A +W @ / =</ %$0 X % / ?$ ;% Q P +W P+Y )# ) Q ,$ *;% # 7

A new generalized Voronoi diagram is defined on the surface of a river with unifonn flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram can be obtained from the ordinary Voronoi diagram by a certain transformation, whereas if ...

Circles are frequently used for modelling the growth of particle aggregates through the Voronoi diagram of circles, that is a special instance of the Johnson-Mehl tessellation. The Voronoi diagram of a set of sites is a decomposition of space into proximal regions. The proximal region of a site is the locus of points closer to that site than to any other one. Voronoi diagrams allow one to answe...

We study the combinatorial complexity of Voronoi diagram of point sites on a general triangulated 2-manifold surface, based on the geodesic metric. Given a triangulated 2-manifold T of n faces and a set of m point sites S = {s1, s2, · · · , sm} ∈ T , we prove that the complexity of Voronoi diagram VT (S) of S on T is O(mn) if the genus of T is zero. For a genus-g manifold T in which the samples...

Given a point set the Voronoi diagram associates to each point all the locations in a plane that are closer to it . This diagram is often used in spatial analysis to divide an area among points. In the ordinary Voronoi diagram the points are treated as equals and the division is done in a purely geometrical way. A weighted Voronoi diagram is defined as an extension of the original diagram. The ...

In the Hausdorff Voronoi diagram of a set of point-clusters in the plane, the distance between a point t and a cluster P is measured as the maximum distance between t and any point in P while the diagram is defined in a nearest sense. This diagram finds direct applications in VLSI computer-aided design. In this paper, we consider “non-crossing” clusters, for which the combinatorial complexity o...

Given in the plane a set S of m point sites simple polygon P n vertices, we consider problem computing geodesic farthest-point Voronoi diagram for P. It is known that has an $$\Omega (n+m\log m)$$ time lower bound. Previously, randomized algorithm was proposed [Barba, SoCG 2019] solves $$O(n+m\log expected time. The previous best deterministic algorithms solve $$O(n\log \log n+ m\log [Oh, Barba...