Minimum area circumscribing Polygons

Alok Aggarwal; J. S. Chang; Chee K. Yap

doi:10.1007/BF01898354

Minimum area circumscribing Polygons

Alok Aggarwal, J. S. Chang, Chee K. Yap

Computer Science

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

Abstract

We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n² log n log k) time.

Original language	English (US)
Pages (from-to)	112-117
Number of pages	6
Journal	The Visual Computer
Volume	1
Issue number	2
DOIs	https://doi.org/10.1007/BF01898354
State	Published - Aug 1985

Keywords

Circumscribing
Convex polygons
Geometric algorithms
Minimum area
Optimization

ASJC Scopus subject areas

Software
Computer Vision and Pattern Recognition
Computer Graphics and Computer-Aided Design

Access to Document

10.1007/BF01898354

Cite this

@article{8ede7e12bd8e45128b679ab12389cf42,

title = "Minimum area circumscribing Polygons",

abstract = "We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time.",

keywords = "Circumscribing, Convex polygons, Geometric algorithms, Minimum area, Optimization",

author = "Alok Aggarwal and Chang, {J. S.} and Yap, {Chee K.}",

year = "1985",

month = aug,

doi = "10.1007/BF01898354",

language = "English (US)",

volume = "1",

pages = "112--117",

journal = "The Visual Computer",

issn = "0178-2789",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Minimum area circumscribing Polygons

AU - Aggarwal, Alok

AU - Chang, J. S.

AU - Yap, Chee K.

PY - 1985/8

Y1 - 1985/8

N2 - We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time.

AB - We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time.

KW - Circumscribing

KW - Convex polygons

KW - Geometric algorithms

KW - Minimum area

KW - Optimization

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

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

U2 - 10.1007/BF01898354

DO - 10.1007/BF01898354

M3 - Article

AN - SCOPUS:0022140356

SN - 0178-2789

VL - 1

SP - 112

EP - 117

JO - The Visual Computer

JF - The Visual Computer

IS - 2

ER -

Minimum area circumscribing Polygons

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this