𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for constructing the convex hull of a set of spheres in dimension d

✍ Scribed by Jean-Daniel Boissonnat; André Cérézo; Olivier Devillers; Jacqueline Duquesne; Mariette Yvinec

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
449 KB
Volume
6
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

A numerical algorithm for the constructi
A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
✍ Hong Xiao; Zydrunas Gimbutas 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 740 KB

squares Newton's method a b s t r a c t We present a numerical algorithm for the construction of efficient, high-order quadratures in two and higher dimensions. Quadrature rules constructed via this algorithm possess positive weights and interior nodes, resembling the Gaussian quadratures in one di