A function f: R → R is unimodal if it increases to a maximum value and then decreases. It is strictly unimodal if the increase and decrease are strict. Unimodality is important for the design of efficient search algorithms because it permits prune-and-search strategies. It also simplifies proofs. An algorithm for R3 is presented which has an application to shape matching. Given convex polygon P and Q and a direction in which to translate P, it is easy to find the translation having maximum overlap with Q in linear time.
CITATION STYLE
Avis, D., Bose, P., Shermer, T. C., Snoeyink, J., Toussaint, G., & Zhu, B. (1996). On the sectional area of convex polytopes. In Proceedings of the Annual Symposium on Computational Geometry. ACM. https://doi.org/10.1145/237218.237411
Mendeley helps you to discover research relevant for your work.