Pages that link to "Item:Q658651"
From MaRDI portal
The following pages link to An adaptive domain-decomposition technique for parallelization of the fast marching method (Q658651):
Displaying 13 items.
- A dynamic domain decomposition for the eikonal-diffusion equation (Q258707) (← links)
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids (Q550889) (← links)
- A highly scalable massively parallel fast marching method for the eikonal equation (Q680108) (← links)
- Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations (Q729573) (← links)
- Parallel level-set methods on adaptive tree-based grids (Q729590) (← links)
- Cache-efficient parallel eikonal solver for multicore CPUs (Q1710371) (← links)
- Parallel redistancing using the Hopf-Lax formula (Q1783414) (← links)
- Shared-memory block-based fast marching method for hierarchical meshes (Q2020521) (← links)
- Overhang control based on front propagation in 3D topology optimization for additive manufacturing (Q2236125) (← links)
- A shared memory parallel multi-mesh fast marching method for re-distancing (Q2326766) (← links)
- ParaVoxel: A Domain Decomposition Based Fixed Grid Preprocessor (Q2971996) (← links)
- A Multiscale Domain Decomposition Algorithm for Boundary Value Problems for Eikonal Equations (Q5197623) (← links)
- An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance (Q5238749) (← links)