233 search results - page 42 / 47 » cccg 2007 |
CCCG
2007
13 years 8 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
CCCG
2007
13 years 8 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
CCCG
2007
13 years 8 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
CCCG
2004
13 years 8 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
CCCG
2004
13 years 8 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...