Finding minimal convex nested polygons

Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee Yap

Research output: Contribution to journalArticle

Abstract

We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm.

Original languageEnglish (US)
Pages (from-to)98-110
Number of pages13
JournalInformation and Computation
Volume83
Issue number1
DOIs
StatePublished - 1989

Fingerprint

Polygon
Optimal Algorithm
Convex polygon

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Finding minimal convex nested polygons. / Aggarwal, Alok; Booth, Heather; O'Rourke, Joseph; Suri, Subhash; Yap, Chee.

In: Information and Computation, Vol. 83, No. 1, 1989, p. 98-110.

Research output: Contribution to journalArticle

Aggarwal, A, Booth, H, O'Rourke, J, Suri, S & Yap, C 1989, 'Finding minimal convex nested polygons', Information and Computation, vol. 83, no. 1, pp. 98-110. https://doi.org/10.1016/0890-5401(89)90049-7
Aggarwal, Alok ; Booth, Heather ; O'Rourke, Joseph ; Suri, Subhash ; Yap, Chee. / Finding minimal convex nested polygons. In: Information and Computation. 1989 ; Vol. 83, No. 1. pp. 98-110.
@article{def8b2b75d9d473eb2c5e42ced1c8c42,
title = "Finding minimal convex nested polygons",
abstract = "We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm.",
author = "Alok Aggarwal and Heather Booth and Joseph O'Rourke and Subhash Suri and Chee Yap",
year = "1989",
doi = "10.1016/0890-5401(89)90049-7",
language = "English (US)",
volume = "83",
pages = "98--110",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - Finding minimal convex nested polygons

AU - Aggarwal, Alok

AU - Booth, Heather

AU - O'Rourke, Joseph

AU - Suri, Subhash

AU - Yap, Chee

PY - 1989

Y1 - 1989

N2 - We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm.

AB - We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm.

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

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

U2 - 10.1016/0890-5401(89)90049-7

DO - 10.1016/0890-5401(89)90049-7

M3 - Article

AN - SCOPUS:0024751427

VL - 83

SP - 98

EP - 110

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 1

ER -