On the sectional area of convex polytopes

David Avis, Prosenjit Bose, Thomas C. Shermer, Jack Snoeyink, Godfried Toussaint, Binhai Zhu

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish (US)
PagesC-11-C-12
StatePublished - 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996

Other

OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period5/24/965/26/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'On the sectional area of convex polytopes'. Together they form a unique fingerprint.

Cite this