𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the design of CGAL a computational geometry algorithms library

✍ Scribed by Andreas Fabri; Geert-Jan Giezeman; Lutz Kettner; Stefan Schirra; Sven Schönherr


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
243 KB
Volume
30
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


The performance of a selection of sortin
✍ DOWSING, R. D.; MARTINS, W. S. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 2 views

In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel mach

On the optimum design of cluster structu
✍ Honglan Jin; Yoshikazu Miyanaga; Koji Tochinai 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

In discussing self-organizing neural networks, to some extent a large-scale network is assumed in order to achieve generality and adaptability. This paper discusses an optimal structurization method for a nonlinear network, based on a self-organizing algorithm with a two-layer structure. The basic s

An efficient implementation of the finit
✍ Umesh D. Navsariwala; Stephen D. Gedney 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 2 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges