CCCG 1997 | Sciweavers

32

CCCG
1997

108views Computational Geometry» more CCCG 1997»

On the number of internal and external visibility edges of polygons

14 years 27 days ago

In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...

Jorge Urrutia

claim paper

Read More »

33

click to vote

CCCG
1997

98views Computational Geometry» more CCCG 1997»

On folding rulers in regular polygons

14 years 27 days ago

Download www.cs.mcgill.ca

Naixun Pei, Sue Whitesides

claim paper

Read More »

43

click to vote

CCCG
1997

129views Computational Geometry» more CCCG 1997»

Label placement by maximum independent set in rectangles

14 years 27 days ago

Download webdoc.gwdg.de

Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...

Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers