✦ LIBER ✦

Fast computation of the modality of polygons

✍ Scribed by Alok Aggarwal; Robert C Melville

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 744 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90028-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast polygonal approximation of digitize

Fast polygonal approximation of digitized curves

✍ Jack Sklansky; Victor Gonzalez 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Fast computation of quasi-TEM parameters

Fast computation of quasi-TEM parameters of multiconductor transmission lines with polygonal cross section

✍ J. Bernal; F. Medina; M. Horno 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

This paper presents an efficient and accurate technique for computing the quasistatic matrix parameters of polygonal cross-section conductors embedded in a layered dielectric medium. The method makes use of accurate closed-form approximations of the dielectric Green's function, entire-domain basis f

Fast computation of the Nth root

✍ S.-G. Chen; P.Y. Hsieh 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 281 KB

The complexity of computing minimum sepa

The complexity of computing minimum separating polygons

✍ Peter Eades; David Rappaport 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Fast computation of moment invariants

✍ Bing-Cheng Li; Jun Shen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Fast computation of continued fractions

✍ Omer Eg̃eciog̃lu; Çetin K. Koç; Josep RifàI Coma 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 149 KB