92
Voted
CCCG
15 years 2 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...
82
Voted
CCCG
15 years 2 months ago
2004 
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
99
Voted
CCCG
15 years 2 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
15 years 2 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...
CCCG
15 years 2 months ago
2004  |
Computational Geometry