233 search results - page 16 / 47 » cccg 2007 |
CCCG
2006
13 years 8 months ago
2006
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
CCCG
2001
13 years 8 months ago
2001
This paper is concerned with applications of Tutte's barycentric embedding theorem (Proc. London Math. Soc. 13 (1963), 743
CCCG
2003
13 years 8 months ago
2003
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to
CCCG
1998
13 years 8 months ago
1998
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.
CCCG
1998
13 years 8 months ago
1998
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