Results 1  10
of
2,516
Marching cubes: A high resolution 3D surface construction algorithm
 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 divideandconquer approach to generate interslice 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 divideandconquer approach to generate interslice 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)
"... An integrated risk management approach ..."
Fast Marching Methods
 SIAM Review
, 1998
"... Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying 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 nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms
Countermanding EyeHead Gaze Shifts in Humans: Marching Orders Are Delivered to the Head First
, 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
 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
 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 runtime from O(N log N) to linear. This lower runtime 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 runtime from O(N log N) to linear. This lower runtime cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm
A SecondOrder Fast Marching Eikonal Solver
, 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
"... The effect of quantum fluctuations on a nearly flat, nonrelativistic twodimensional membrane with extrinsic curvature stiffness and tension is investigated. The renormalization group analysis is carried out in firstorder 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 twodimensional membrane with extrinsic curvature stiffness and tension is investigated. The renormalization group analysis is carried out in firstorder perturbative theory. In contrast to thermal fluctuations, which soften
MiniMarch
, 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
, 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