On the sectional area of convex polytopes

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

On the sectional area of convex polytopes

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

Computer Science

Research output: Contribution to conference › Paper › peer-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 R³ 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 language	English (US)
Pages	C-11-C-12
State	Published - 1996
Event	Proceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA Duration: May 24 1996 → May 26 1996

Other

Other	Proceedings of the 1996 12th Annual Symposium on Computational Geometry
City	Philadelphia, PA, USA
Period	5/24/96 → 5/26/96

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Cite this

@conference{aea30be3b01d447aa5beb60bf7ead4ea,

title = "On the sectional area of convex polytopes",

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.",

author = "David Avis and Prosenjit Bose and Shermer, {Thomas C.} and Jack Snoeyink and Godfried Toussaint and Binhai Zhu",

year = "1996",

language = "English (US)",

pages = "C--11--C--12",

note = "Proceedings of the 1996 12th Annual Symposium on Computational Geometry ; Conference date: 24-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - On the sectional area of convex polytopes

AU - Avis, David

AU - Bose, Prosenjit

AU - Shermer, Thomas C.

AU - Snoeyink, Jack

AU - Toussaint, Godfried

AU - Zhu, Binhai

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=4243882862&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243882862&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:4243882862

SP - C-11-C-12

T2 - Proceedings of the 1996 12th Annual Symposium on Computational Geometry

Y2 - 24 May 1996 through 26 May 1996

ER -

On the sectional area of convex polytopes

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this