Search Sciweavers | Sciweavers

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

claim paper

Read More »

13

click to vote

CCCG
1998

87views Computational Geometry» more CCCG 1998»

Illuminating triangles and quadrilaterals with vertex floodlights

13 years 6 months ago

Download www.matem.unam.mx

We show that three /6 vertex floodlights suffice to illuminate any triangle, and we prove that any quadrilateral can be illuminated by three /4 vertex floodlights.

Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji,...

claim paper

Read More »

20

click to vote

CCCG
1998

155views Computational Geometry» more CCCG 1998»

Proximity drawings of binary trees in polynomial area

13 years 6 months ago

Download www.dia.unisa.it

In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...

Paolo Penna, Paola Vocca

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers