### 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 language | English (US) |
---|---|

Pages (from-to) | 98-110 |

Number of pages | 13 |

Journal | Information and Computation |

Volume | 83 |

Issue number | 1 |

DOIs | |

State | Published - 1989 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Information and Computation*,

*83*(1), 98-110. https://doi.org/10.1016/0890-5401(89)90049-7

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

Research output: Contribution to journal › Article

*Information and Computation*, vol. 83, no. 1, pp. 98-110. https://doi.org/10.1016/0890-5401(89)90049-7

}

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 -