𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial complexity of signed discs

✍ Scribed by Diane L. Souvaine; Chee-Keng Yap

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
790 KB
Volume
5
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complexity of Some Combinatorial Con
The Complexity of Some Combinatorial Constructions
✍ Hans Georg Carstens πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 530 KB

THE COMPLEXITY OF SOME COMBINATORIAL CONSTRUCTIONS by HASS GEORG C'ARSTENS in Hanriover (G.F.R.

Optimizing the topological and combinato
Optimizing the topological and combinatorial complexity of isosurfaces
✍ Carlos AndΓΊjar; Pere Brunet; Antoni Chica; Isabel Navazo; Jarek Rossignac; Γ€lvar πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 506 KB

Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of isosurfaces. Most approaches divide the 3D space into cubes that each occupy the space between eight neighboring samples