Results 1 - 10 of 2,516

Marching cubes: A high resolution 3D surface construction algorithm

by William E. Lorensen, Harvey E. Cline - COMPUTER GRAPHICS , 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract - Cited by 2696 (4 self) - Add to MetaCart
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical

The Australian Soldier Context Mean Marching Order Loads (M only)

by Robin M. Orr, A/prof Rob Orr
"... An integrated risk management approach ..."
Abstract - Add to MetaCart
An integrated risk management approach

Fast Marching Methods

by J. A. Sethian - SIAM Review , 1998
"... Fast Marching Methods are numerical schemes for computing solutions to the non-linear Eikonal equation and related static Hamilton-Jacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are opti ..."
Abstract - Cited by 215 (5 self) - Add to MetaCart
Fast Marching Methods are numerical schemes for computing solutions to the non-linear Eikonal equation and related static Hamilton-Jacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms

Countermanding Eye-Head Gaze Shifts in Humans: Marching Orders Are Delivered to the Head First

by Brian D. Corneil, James K. Elsley, Brian D. Corneil, James K. Elsley , 2005
"... You might find this additional info useful... This article cites 47 articles, 19 of which you can access for free at: ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
You might find this additional info useful... This article cites 47 articles, 19 of which you can access for free at:

Geometric Compression through Topological Surgery

by Gabriel Taubin, Jarek Rossignac - ACM TRANSACTIONS ON GRAPHICS , 1998
"... ... this article introduces a new compressed representation for complex triangulated models and simple, yet efficient, compression and decompression algorithms. In this scheme, vertex positions are quantized within the desired accuracy, a vertex spanning tree is used to predict the position of each ..."
Abstract - Cited by 283 (28 self) - Add to MetaCart
. The vertex spanning tree and a small set of jump edges are used to split the model into a simple polygon. A triangle spanning tree and a sequence of marching bits are used to encode the triangulation of the polygon. Our approach improves on Michael Deering's pioneering results by exploiting

O(N) Implementation of the Fast Marching Algorithm

by Liron Yatziv, Alberto Bartesaghi, Guillermo Sapiro - Journal of Computational Physics , 2005
"... In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original run-time from O(N log N) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improv ..."
Abstract - Cited by 69 (11 self) - Add to MetaCart
In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original run-time from O(N log N) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm

A Second-Order Fast Marching Eikonal Solver

by James Rickett Sergey Fomel, James Rickett, Sergey Fomel , 2000
"... INTRODUCTION The fast marching method (Sethian, 1996) is widely used for solving the eikonal equation in Cartesian coordinates. The method's principal advantages are: stability, computational efficiency, and algorithmic simplicity. Within geophysics, fast marching traveltime calculations (Popo ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
INTRODUCTION The fast marching method (Sethian, 1996) is widely used for solving the eikonal equation in Cartesian coordinates. The method's principal advantages are: stability, computational efficiency, and algorithmic simplicity. Within geophysics, fast marching traveltime calculations

March 2000

by Physics Letters Www, M. E. S. Borelli, H. Kleinert, Adriaan M. J. Schakel, Communicated A. Lagendijk
"... The effect of quantum fluctuations on a nearly flat, nonrelativistic two-dimensional membrane with extrinsic curvature stiffness and tension is investigated. The renormalization group analysis is carried out in first-order perturbative theory. In contrast to thermal fluctuations, which soften the me ..."
Abstract - Add to MetaCart
The effect of quantum fluctuations on a nearly flat, nonrelativistic two-dimensional membrane with extrinsic curvature stiffness and tension is investigated. The renormalization group analysis is carried out in first-order perturbative theory. In contrast to thermal fluctuations, which soften

MiniMarch

by Siert Wieringa, M. Heule , 2007
"... MiniMarch is a modified version of MiniSat 2.0. The design goal was to make a version of MiniSat that is less sensitive to shuffling of the input formula. MiniMarch extends MiniSat with the following techniques: ˆ Clause sorting By sorting the clauses we not only hope to find conflict clauses imposi ..."
Abstract - Add to MetaCart
MiniMarch is a modified version of MiniSat 2.0. The design goal was to make a version of MiniSat that is less sensitive to shuffling of the input formula. MiniMarch extends MiniSat with the following techniques: ˆ Clause sorting By sorting the clauses we not only hope to find conflict clauses

The Gaussian Watermarking Game

by Aaron S. Cohen, Amos Lapidoth, Dedicated Aaron, D. Wyner , 2000
"... Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" shoul ..."
Abstract - Cited by 135 (7 self) - Add to MetaCart
Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "
Results 1 - 10 of 2,516