Finding the minimum visible vertex distance between two non-intersecting simple polygons
- 1 January 1986
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
In this paper, we present an &Ogr;(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 polygons. We also derive an &Ogr;(n log n) algorithm for finding a minimum sequence of separating line segments between two nonintersecting polygons.This publication has 0 references indexed in Scilit: