Published 1985
by Courant Institute of Mathematical Sciences, New York University in New York .
Written in English
Edition Notes
| Statement | by Alok Aggarwal, Chee K. Yap [and others]. |
| Series | Robotics report -- 41 |
| Contributions | Yap, Chee K. |
| The Physical Object | |
|---|---|
| Pagination | 9 p. |
| ID Numbers | |
| Open Library | OL17979589M |
Aggarwal, A, Booth, H, O'Rourke, J, Suri, S & Yap, C , Finding minimal convex nested polygons. in NYU-Courant Institute, Robotics Lab. vol. 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 Aggarwal, A, Booth, H, O'Rourke, J, Suri, S & Yap, C , Finding minimal convex nested polygons. in 1st ACM Symposium on Computational Geometry. Baltimore, Maryland Buy Robotics Research Technical Report: Finding Mineral Convex Nested Polygons (Classic Reprint) on FREE SHIPPING on qualified orders
An algorithm for finding a polygon with minimum number of edges nested in two simplen-sided polygons is presented. The algorithm solves the problem in at mostO(n logn) time, and improves the time complexity of two previousO(n 2) :// Abstract. AbstractWe 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 :// Finding minimal nested polygons, [5] R.L. Graham and F.F. Yao, Finding the convex hull of a Tech. Rept The Johns Hopkins University, Baltimore, simple polygon, J. Packages And Polygons Mathematics In Context {Two minimal cute siblings looking through a book in mattress around Xmas tree with lights and
In this paper, we propose efficient algorithms for computing the complete and weak visibility polygons of a simple polygon P of n vertices from a convex set C inside P. The algorithm for computing the complete visibility polygon of P from C takes O(n + k) time in the worst case, where k is the number of extreme points of the convex set C. Given a triangulation of P - C, the algorithm for Interior Angles: n-2 (n is number of sides) ____ Exterior angles are always :// In this paper, we present an Ο(n log n) algorithm for finding the minimum Euclidean visible vertex distance between two nonintersecting simple polygons, where n is the number of vertices in a polygon. The algorithm is based on applying a divide and conquer method to two preprocessed facing boundaries of the :// Finding Minimum Area k-gons ⁄ David Eppsteiny Mark Overmarsz G˜unter Rotex Gerhard Woegingerx Abstract Given a set P of npoints in the plane and a number k, we want to flnd a polygon Cwith vertices in Pof minimum area that satisfles one of the following properties: (1) Cis a convex k-gon, (2) Cis an empty convex k-gon, or (3) Cis the convex hull of exactly kpoints of ~eppstein/pubs/EppOveRot-DCGpdf.
