123
Voted
CCCG
15 years 3 months ago
1994 
We consider bounding the cardinality of an arbitrary triangulation with smallest angle : We show that if the local feature size (i.e. distance between disjoint vertices or edges) ...
116
Voted
CCCG
15 years 3 months ago
1994 
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
CCCG
15 years 3 months ago
1994 CCCG
15 years 3 months ago
1994 84
Voted
CCCG
15 years 3 months ago
1994  |
Computational Geometry