116
click to vote
CCCG
15 years 3 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...
112
click to vote
CCCG
15 years 3 months ago
2004 
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
111
click to vote
CCCG
15 years 3 months ago
2004
We prove that any given well-behaved folded state of a piece of paper can be reached via a continuous folding process starting from the unfolded paper and ending with the folded st...
106
click to vote
CCCG
15 years 3 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
|
Computational Geometry