Finding the minimum visible vertex distance between two non-intersecting simple polygons

Authors:
C Wang;E P F Chan
Affiliations:
Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, T6G 2H1;Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, T6G 2H1
Venue:
SCG '86 Proceedings of the second annual symposium on Computational geometry
Year:
1986

Citing 5
Cited 2

Computing the extreme distances between two convex polygons

Journal of Algorithms
Distance problems in computational geometry with fixed orientations

SCG '85 Proceedings of the first annual symposium on Computational geometry
Finding minimal convex nested polygons

SCG '85 Proceedings of the first annual symposium on Computational geometry
Triangulating Simple Polygons and Equivalent Problems

ACM Transactions on Graphics (TOG)
Detection is easier than computation (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Optimal link path queries in a simple polygon

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Separation and approximation of polyhedral objects

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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.