7 search results - page 2 / 2 » cccg 1994 |
91
Voted
CCCG
1994
14 years 11 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) ...
CCCG
1994
14 years 11 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...