scholarly journals The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon

Algorithmica ◽  
2019 ◽  
Vol 82 (5) ◽  
pp. 1434-1473
Author(s):  
Eunjin Oh ◽  
Luis Barba ◽  
Hee-Kap Ahn
1996 ◽  
Vol 06 (03) ◽  
pp. 263-278 ◽  
Author(s):  
ROLF KLEIN ◽  
ANDRZEJ LINGAS

For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and only if v is the closest vertex of P visible from p. We present a randomized algorithm that builds the bounded Voronoi diagram of a simple polygon in linear expected time. Among other applications, we can construct within the same time bound the generalized Delaunay triangulation of P and the minimal spanning tree on P’s vertices that is contained in P.


1995 ◽  
Vol 27 (8) ◽  
pp. 605-614 ◽  
Author(s):  
Deok-Soo Kim ◽  
Il-Kyu Hwang ◽  
Bum-Joo Park

Author(s):  
Joseph Pegna ◽  
Chi Guo ◽  
Thierry P. Hilaire

Abstract The work presented in this paper derives from the design of a position sensing interferometer, in which circular fringe patterns are automatically analyzed by a computer vision system. Central to this process is a circle fitting problem in the sense of least Linfinity norm, also known as Chebichev or MinMax fit. The problem at hand can be formulated as follows: Given a set of points in the plane, find the pair of concentric circles with minimum radial gap enclosing all the points. The solution to this problem is elegantly given by common computational geometry tools, indeed the center of such a circle is necessarily a vertex of the Nearest Point Voronoi Diagram (NVD), a vertex of the Farthest Point Voronoi Diagram (FVD), or an intersection of edges from both diagrams. An algorithm for determining the Chebichev circular fit is presented and illustrated on the basis of that observation. Applications and potential extensions of this method to soft gauging and image metrology will also be discussed.


Sign in / Sign up

Export Citation Format

Share Document