Finding the minimum visible vertex distance between two non-intersecting simple polygons
C Wang, Edward P. F. Chan · 1986
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 polygons. We also derive an Ο(n log n) algorithm for finding a minimum sequence of separating line segments between two nonintersecting polygons.