137
click to vote
CCCG
15 years 5 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...
129
click to vote
CCCG
15 years 5 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...
123
Voted
CCCG
15 years 5 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...
121
click to vote
CCCG
15 years 5 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...
|
Computational Geometry