DETERMINING THE SEPARATION OF SIMPLE POLYGONS
From MaRDI portal
Publication:4327390
DOI10.1142/S0218195994000240zbMath0829.68060MaRDI QIDQ4327390
Publication date: 6 April 1995
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
Determining Weak Visibility of a Polygon from an Edge in Parallel, On determining optimal strategies in pursuit games in the plane, Finding a closet visible vertex pair between two polygons, EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS