On point covers of c-oriented polygons

14 years 7 days ago

Download www.lix.polytechnique.fr

Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a

Frank Nielsen

Real-time Traffic

C-oriented Polygons | CCCG 1998 | CCCG 2007 | Pairwise Disjoint Objects | Two-dimensional Euclidean Plane |

claim paper

Related Content

» Translational polygon covering using intersection graphs

» Optimal Cover of Points by Disks in a Simple Polygon

» Decompositions Partitions and Coverings with Convex Polygons and PseudoTriangles

» Multiguard covers for polygonal regions

» Translational Covering of Closed Planar Cubic BSpline Curves

» Base station placement on boundary of a convex polygon

» Generalized Watchman Route Problem with Discrete View Cost

» On the Reflexivity of Point Sets

» On the variance of random polygons

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	CCCG
Authors	Frank Nielsen

Comments (0)

Sciweavers

On point covers of c-oriented polygons

C-oriented Polygons | CCCG 1998 | CCCG 2007 | Pairwise Disjoint Objects | Two-dimensional Euclidean Plane |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers