Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Weighted essentially non-oscillatory schemes
Journal of Computational Physics
A variational level set approach to multiphase motion
Journal of Computational Physics
VIS '97 Proceedings of the 8th conference on Visualization '97
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SIAM Review
Computing contour trees in all dimensions
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Path seeds and flexible isosurfaces using topology for exploratory visualization
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
Topologically adaptable snakes
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Parallel Computation of the Topology of Level Sets
Algorithmica
Simplifying Flexible Isosurfaces Using Local Geometric Measures
VIS '04 Proceedings of the conference on Visualization '04
Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets
Journal of Scientific Computing
Topology-Controlled Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Image Processing
Hi-index | 0.00 |
One of the most common visualization tasks is the extraction of significant boundaries, often performed with isosurfaces or level set segmentation. Isosurface extraction is simple and can be guided by geometric and topological analysis, yet frequently does not extract the desired boundary. Level set segmentation is better at boundary extraction, but either leads to global segmentation without edges, [CV01], that scales unfavorably in 3D or requires an initial estimate of the boundary from which to locally solve segmentation with edges. We propose a hybrid system in which topological analysis is used for semi-automatic initialization of a level set segmentation, and geometric information bounded topologically is used to guide and accelerate an iterative segmentation algorithm that combines several state-of-the-art level set terms. We thus combine and improve both the flexible isosurface interface and level set segmentation without edges.