Computing the minimum visible vertex distance between two polygons

DOI10.1007/3-540-51542-9_11MaRDI QIDQ4028879zbMATH OpenFDO

Authors Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_11

zbMATH Keywords

closest pairlink-distancewindow-trees

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 278832
• Finding a closet visible vertex pair between two polygons
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• An optimal algorithm for finding the separation of simple polygons

Cited in

(10)

• Optimal time bounds for some proximity problems in the plane
• Computing the shortest diagonal of a monotone polygon in linear time
• Finding a closet visible vertex pair between two polygons
• Subtraction of two 2D polygons with some matching vertices
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• An optimal algorithm for finding the separation of simple polygons
• Minimizing Distance-to-Sight in Polygonal Domains
• scientific article; zbMATH DE number 278832 (Why is no real title available?)
• Computing the longest diagonal of a simple polygon

This page was built for publication: Computing the minimum visible vertex distance between two polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028879)