DETERMINING THE SEPARATION OF SIMPLE POLYGONS

From MaRDI portal

Revision as of 21:04, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4327390

Jump to:navigation, search

DOI10.1142/S0218195994000240zbMath0829.68060MaRDI QIDQ4327390

Nancy M. Amato

Publication date: 6 April 1995

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

zbMATH Keywords

separation vertex problems

Mathematics Subject Classification ID

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

Related Items (4)

Finding a closet visible vertex pair between two polygons ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS ⋮ On determining optimal strategies in pursuit games in the plane ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4327390&oldid=18283231"