On the sectional area of convex polytopes

9Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

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.

Cited by Powered by Scopus

Computing the maximum overlap of two convex polygons under translations

41Citations
N/AReaders
Get full text

Matching convex shapes with respect to the symmetric difference

29Citations
N/AReaders
Get full text

Guarding scenes against invasive hypercubes

15Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

40%

Professor / Associate Prof. 3

30%

Researcher 2

20%

Lecturer / Post doc 1

10%

Readers' Discipline

Tooltip

Computer Science 9

82%

Physics and Astronomy 1

9%

Mathematics 1

9%

Save time finding and organizing research with Mendeley

Sign up for free