scientific article; zbMATH DE number 140463

MaRDI QIDQ4028879zbMATH OpenFDO

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

Publication date 28 March 1993

zbMATH Keywords

closest pairlink-distancewindow-trees

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) 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

(9)

• scientific article; zbMATH DE number 278832 (Why is no real title available?)
• Computing the longest diagonal of a simple polygon
• 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
• Optimal time bounds for some proximity problems in the plane
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• An optimal algorithm for finding the separation of simple polygons
• Computing the shortest diagonal of a monotone polygon in linear time

This page was built for publication:

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