✦ LIBER ✦

Arcwise Connectedness of Closed Efficient Point Sets

✍ Scribed by E.K. Makarov; N.N. Rachkovski; Wen Song

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 80 KB
Volume: 247
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.6814

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Contractibility and Connectedness

On the Contractibility and Connectedness of an Efficient Point Set

✍ Xunhua Gong 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Smooth Triangular Maps of the Square wit

Smooth Triangular Maps of the Square with Closed Set of Periodic Points

✍ C. Arteaga 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Improved efficiency of focal point confo

Improved efficiency of focal point conformational analysis with truncated correlation consistent basis sets

✍ Kalju Kahn; Iiris Kahn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract It has been suggested that the computational cost of correlated ab initio calculations could be reduced efficiently by using truncated basis sets on hydrogen atoms (Mintz et al., J Chem Phys 2004, 121, 5629). We now explore this proposal in the context of conformational analysis of smal

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of