Largest placement of one convex polygon inside another

P. K. Agarwal; N. Amenta; M. Sharir

doi:10.1007/PL00009337

Largest placement of one convex polygon inside another

P. K. Agarwal^*, N. Amenta, M. Sharir

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn² log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn²), and that it can also be computed in O(mn² log n) time.

Original language	English
Pages (from-to)	95-104
Number of pages	10
Journal	Discrete and Computational Geometry
Volume	19
Issue number	1
DOIs	https://doi.org/10.1007/PL00009337
State	Published - Jan 1998

Funding

Funders	Funder number
National Science Foundation	8920161

Access to Document

10.1007/PL00009337

Cite this

@article{9bb6cbc578f649d486e88977a04704ad,

title = "Largest placement of one convex polygon inside another",

abstract = "We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn2), and that it can also be computed in O(mn2 log n) time.",

author = "Agarwal, {P. K.} and N. Amenta and M. Sharir",

year = "1998",

month = jan,

doi = "10.1007/PL00009337",

language = "אנגלית",

volume = "19",

pages = "95--104",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Largest placement of one convex polygon inside another

AU - Agarwal, P. K.

AU - Amenta, N.

AU - Sharir, M.

PY - 1998/1

Y1 - 1998/1

N2 - We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn2), and that it can also be computed in O(mn2 log n) time.

AB - We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn2), and that it can also be computed in O(mn2 log n) time.

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

U2 - 10.1007/PL00009337

DO - 10.1007/PL00009337

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0032326612

SN - 0179-5376

VL - 19

SP - 95

EP - 104

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

Largest placement of one convex polygon inside another

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this