✦ LIBER ✦

An optimal algorithm for solving collision distance between convex polygons in plane

✍ Scribed by Yong Yan

Book ID: 112945696
Publisher: Springer
Year: 1993
Tongue: English
Weight: 465 KB
Volume: 8
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02939545

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for computing the m

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB

An optimal parallel algorithm for solvin

An optimal parallel algorithm for solving the maximal elements problem in the plane

✍ Ivan Stojmenović; Masahiro Miyakawa 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 125 KB

An optimal real time algorithm for deter

An optimal real time algorithm for determine the convex hull of a set of points in a plane

✍ Z.Q. Wang; L.J. Xiao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four