✦ LIBER ✦

A novel and efficient implementation of the marching cubes algorithm

✍ Scribed by K.S Delibasis; G.K Matsopoulos; N.A Mouravliansky; K.S Nikita

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 895 KB
Volume: 25
Category: Article
ISSN: 0895-6111
DOI: 10.1016/s0895-6111(00)00082-3

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a novel and ef®cient implementation of the marching cubes (MC) algorithm is presented for the reconstruction of anatomical structures from real three-dimensional medical data. The proposed approach is based on a generic rule, able to triangulate all 15 standard cube con®gurations used in the classical MC algorithm as well as additional cases presented in the literature. The proposed implementation of the MC algorithm can handle the Type A hole problem' which occurs when at least one cube face has an intersection point in each of its four edges. Theoretical and experimental results demonstrate the ability of the new implementation to reproduce standard MC results, resolving Type A hole problem'. Finally, the proposed implementation was applied to real medical date to reconstruct anatomical structures. The output of the proposed technique is in WWW compliant format.

📜 SIMILAR VOLUMES

Efficient Implementation of the Nelder–M

Efficient Implementation of the Nelder–Mead Search Algorithm

✍ Saša Singer; Sanja Singer 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 137 KB

An efficient concurrent implementation o

An efficient concurrent implementation of a neural network algorithm

✍ R. Andonie; A. T. Chronopoulos; D. Grosu; H. Galmeanu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an arc

Efficient mapping and implementation of

Efficient mapping and implementation of matrix algorithms on a hypercube

✍ Vladimir Cherkassky; Ross Smith 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 864 KB

Efficient implementation of THINC scheme

Efficient implementation of THINC scheme: A simple and practical smoothed VOF algorithm

✍ Kensuke Yokoi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 728 KB

In this paper, we improve the multi-dimensional THINC (tangent of hyperbola for interface capturing) scheme [F. Xiao, Y. Honma, T. Kono, A simple algebraic interface capturing scheme using hyperbolic tangent function, Int. J. Numer. Meth. Fluid. 48 (2005) 1023]. The THINC scheme is a VOF (volume of

An efficient implementation of the finit

An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm

✍ Umesh D. Navsariwala; Stephen D. Gedney 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 3 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

dsoa: The implementation of a dynamic sy

dsoa: The implementation of a dynamic system optimization algorithm

✍ Brian C. Fabien 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract This paper describes the ANSI C/C++ computer program dsoa, which implements an algorithm for the approximate solution of dynamics system optimization problems. The algorithm is a direct method that can be applied to the optimization of dynamic systems described by index‐1 differential‐a