CCCG
13 years 11 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...
CCCG
13 years 11 months ago
2004  CCCG
13 years 11 months ago
2004 CCCG
13 years 11 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
13 years 11 months ago
2004 |
Computational Geometry