Paper
Shadow carving
Silvio Savarese, Holly Rushmeier, et al.
Proceedings of the IEEE International Conference on Computer Vision
Paper
Minimum area circumscribing Polygons
Abstract
We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time. © 1985 Springer-Verlag.
Related
Conference paper
Fingerprint image enhancement using weak models
Jonathan H. Connell, Nalini K. Ratha, et al.
ICIP 2002
Nicholas Mastronarde, Deepak S. Turaga, et al.
ICIP 2006
Arnon Amir, M. Lindenbaum
Computer Vision and Image Understanding