Pages that link to "Item:Q2581675"

The following pages link to O(\(N\)) implementation of the fast marching algorithm (Q2581675):

Displaying 17 items.

• Structure-sensitive superpixels via geodesic distance (Q362067) (← links)
• A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching (Q408814) (← links)
• Exploration of 2D and 3D environments using Voronoi transform and fast marching method (Q614641) (← links)
• An adaptive domain-decomposition technique for parallelization of the fast marching method (Q658651) (← links)
• Segmentation of complex geophysical structures with well data (Q708059) (← links)
• A fast-marching like algorithm for geometrical shock dynamics (Q728994) (← links)
• An immersed boundary method for geometrical shock dynamics (Q782022) (← links)
• Automatic optimal feeder design in steel casting process (Q839274) (← links)
• A geodesic approach to calculating the information sets in dynamic search problems (Q845538) (← links)
• Generalized fast marching method: applications to image segmentation (Q937178) (← links)
• A second order discontinuous Galerkin fast sweeping method for eikonal equations (Q942262) (← links)
• Interactively multiphase image segmentation based on variational formulation and graph cuts (Q991916) (← links)
• Fast asymmetric fronts propagation for image segmentation (Q1799533) (← links)
• Revisiting priority queues for image analysis (Q1957852) (← links)
• Fast and accurate surface normal integration on non-rectangular domains (Q2287959) (← links)
• Ordered line integral methods for solving the eikonal equation (Q2291900) (← links)
• A Continuous Finite Element Method with Homotopy Vanishing Viscosity for Solving the Static Eikonal Equation (Q5077706) (← links)