Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

ESA
2010
Springer

favoriteEmaildiscussreport

202views Algorithms» more ESA 2010»

Optimal Cover of Points by Disks in a Simple Polygon

13 years 12 months ago

Optimal Cover of Points by Disks in a Simple Polygon

Download www.cs.tau.ac.il

Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Mi

Real-time Traffic

Algorithms | ESA 2010 |

claim paper

Related Content

» Multiguard covers for polygonal regions

» Polynomial time approximation schemes for minimum disk cover problems

» Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons

» Decompositions Partitions and Coverings with Convex Polygons and PseudoTriangles

» Covering point sets with two disjoint disks or squares

» Optimal System of Loops on an Orientable Surface

» New Results on Visibility in Simple Polygons

» Packing Two Disks into a Polygonal Environment

» A CoveragePreserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in Wir...

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ESA
Authors	Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir

Comments (0)