✦ LIBER ✦

A Containment Algorithm for Point Sets Determined by Polygonal Paths

✍ Scribed by Petty, J. V.

Book ID: 118196479
Publisher: Society for Industrial and Applied Mathematics
Year: 1977
Tongue: English
Weight: 845 KB
Volume: 33
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0133038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A cell-based point-in-polygon algorithm

A cell-based point-in-polygon algorithm suitable for large sets of points

✍ Borut Žalik; Ivana Kolingerova 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 363 KB

An algorithm for determining the minimal

An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

✍ J.B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 467 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

A fast algorithm for determining the dis

A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement

✍ A. V. Karzanov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 347 KB

On a Monte Carlo method algorithm for co

On a Monte Carlo method algorithm for computing functionals defined by the paths of a non-linear set of stochastic differential equations

✍ Yu.N. Kondyurin 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 430 KB