Finding the maximum bounded intersection of k out of n halfplanes
References (8)
- et al.
Finding the smallest triangles containing a given convex polygon
Journal of Algorithms
(1985) - et al.
An optimal algorithm for finding minimum enclosing triangles
Journal of Algorithms
(1986) Computing a minimum-weight k-link path in graphs with the concave Monge property
Journal of Algorithms
(1998)- et al.
Minimum area circumscribing polygons
Visual Computer
(1985)
There are more references available in the full text version of this article.
Cited by (0)
- 1
Supported by Korean Research Foundation Grant (KRF-2007-531-D00018).
Copyright © 2009 Elsevier B.V. Published by Elsevier B.V. All rights reserved.