233 search results - page 18 / 47 » cccg 2007 |
CCCG
2007
13 years 10 months ago
2007
CCCG
2004
13 years 9 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...
CCCG
2004
13 years 9 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...
CCCG
2006
13 years 9 months ago
2006
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
CCCG
2006
13 years 9 months ago
2006
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...