Sciweavers

44 search results - page 1 / 9
» Optimal Cover of Points by Disks in a Simple Polygon
Sort
View
ESA
2010
Springer
202views Algorithms» more  ESA 2010»
13 years 12 months ago
Optimal Cover of Points by Disks in a Simple Polygon
Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Mi...
CCCG
2010
14 years 10 days ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
JCO
2010
182views more  JCO 2010»
13 years 9 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
PAAPP
1998
149views more  PAAPP 1998»
13 years 10 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
GC
2007
Springer
13 years 10 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...