A generalized front marching algorithm for the solution of the eikonal equation
Journal of Computational and Applied Mathematics
A study of numerical methods for the level set approach
Applied Numerical Mathematics
Embedded real-time architecture for level-set-based active contours
EURASIP Journal on Applied Signal Processing
Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images
Journal of Mathematical Imaging and Vision
An Image Inpainting Algorithm Based on Local Geometric Similarity
MMM '09 Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
Journal of Scientific Computing
Algebraic and geometric approximation of waves among obstacles
Computer-Aided Design
A modified fast marching method
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 4
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Some Improvements for the Fast Sweeping Method
SIAM Journal on Scientific Computing
A Third Order Accurate Fast Marching Method for the Eikonal Equation in Two Dimensions
SIAM Journal on Scientific Computing
An application of circumscribed circle filter in the Multi-Stencils Fast Marching method
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Fast Two-scale Methods for Eikonal Equations
SIAM Journal on Scientific Computing
Abstractions and Middleware for Petascale Computing and Beyond
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
A propagating interface can develop corners and discontinuities as it advances. Level set algorithms have been extensively applied for the problems in which the solution has advancing fronts. One of the most popular level set algorithms is the so-called {fast marching method} (FMM), which requires total $\cal O(N\log_2N)$ operations, where N is the number of grid points. The article is concerned with the development of an $\cal O(N)$ level set algorithm called the group marching method (GMM). The new method is based on the narrow band approach as in the FMM. However, it is incorporating a correction-by-iteration strategy to advance a group of grid points at a time, rather than sorting the solution in the narrow band to march forward a single grid point. After selecting a group of grid points appropriately, the GMM advances the group in two iterations for the cost of slightly larger than one iteration. Numerical results are presented to show the efficiency of the method, applied to the eikonal equation in two and three dimensions.