Results 201 to 210 of about 4,255,094 (265)

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Discrete & Computational Geometry, 2017
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric.
Eunjin Oh, Hee-Kap Ahn
semanticscholar   +1 more source

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon

International Symposium on Computational Geometry, 2016
Given a set of sites (points) in a simple polygon, the farthest-point geodesic Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric ...
Eunjin Oh, Luis Barba, Hee-Kap Ahn
semanticscholar   +1 more source

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon

Discrete & Computational Geometry, 2015
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P.
Hee-Kap Ahn, Luis Barba, P. Bose, J. Carufel, Matias Korman, Eunjin Oh   +5 more
semanticscholar   +1 more source

Use of simple polygonal chains in generating random simple polygons

Japan Journal of Industrial and Applied Mathematics, 2017
The main motivation for generating random simple polygons is to produce test instances for geometric algorithms. In this paper three new algorithms are proposed to generate random simple polygons. A point set in a two dimensional plane is the input, and a simple polygon is the output of the problem.
Mohsen Movahedinejad, Ali Nourollah
openaire   +2 more sources

Time-Space Trade-offs for Triangulating a Simple Polygon

Scandinavian Workshop on Algorithm Theory, 2015
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space.
B. Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen   +4 more
semanticscholar   +1 more source

Guarding in a simple polygon

Information Processing Letters, 2000
Guarding in a simple polygon was motivated by art gallery problems. A guard capable of moving along a line segment in a polygon is called a mobile guard. In this paper, we discuss about two different degrees of patrol freedom of mobile guards. First, a guard diagonal is an internal diagonal that a mobile guard moving along the diagonal in a polygon and
Chuan Yi Tang, Bor-Kuan Lu, Fang-Rong Hsu   +2 more
openaire   +2 more sources

GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON [PDF]

International Journal of Computational Geometry & Applications, 2007
Let P be a simple polygon of n vertices and let S be a set of N points lying in the interior of P. A geodesic diskGD(p,r) with center p and radius r is the set of points in P that have a geodesic distance ≤ r from p (where the geodesic distance is the length of the shortest polygonal path connection that lies in P).
Marc van Kreveld, Jun Luo, Magdalene G. Borgelt   +2 more
openaire   +4 more sources

Generating a Simple Polygonalizations

2011 15th International Conference on Information Visualisation, 2011
We consider the methods of construction simple polygons for a set S of n points and applying them for searching the minimal area polygon. In this paper we propose the approximate algorithm, which generates the simple polygonalizations of a fixed point set and finds the minimum area polygon, in O(n3) time and using O(n2) memory.
V. Tereshchenko, V. Muravitskiy
openaire   +2 more sources

MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON

International Journal of Computational Geometry & Applications, 1992
Let P be a simple planar polygon. We present a linear time algorithm for constructing the bounded Voronoi diagram of P in the Manhattan metric, where each point z in P belongs to the region of the closest vertex of P that is visible from z. Among other consequences, the minimum spanning tree of the vertices in the Manhattan metric that is contained in
Rolf Klein, Andrzej Lingas
openaire   +2 more sources

Morphing simple polygons

Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994
In this paper we investigate the problem of morphing (i.e. continuously deforming) one simple polygon into another. We assume that our two initial polygons have the same number of sides n, and that corresponding sides are parallel. We show that a morph is always possible by a varying simple interpolating polygon also of n sides parallel to those of the
John Hershberger, Leonidas J. Guibas
openaire   +2 more sources