DETERMINING THE SEPARATION OF SIMPLE POLYGONS

DOI10.1142/S0218195994000240MaRDI QIDQ4327390zbMATH OpenFDO

Authors Nancy M. Amato

Publication date 6 April 1995

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195994000240

zbMATH Keywords

separationvertex problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• An optimal algorithm for finding the separation of simple polygons
• scientific article; zbMATH DE number 278832
• Parallel algorithms for some functions of two convex polygons
• Finding a closet visible vertex pair between two polygons
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

Cited in

(10)

• Parallel algorithms for some functions of two convex polygons
• On determining optimal strategies in pursuit games in the plane
• Finding a closet visible vertex pair between two polygons
• Recognizing weakly simple polygons
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• scientific article; zbMATH DE number 4121493 (Why is no real title available?)
• An optimal algorithm for finding the separation of simple polygons
• Dividing a polygon into two similar polygons
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

This page was built for publication: DETERMINING THE SEPARATION OF SIMPLE POLYGONS

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