Results 31 to 40 of about 1,296,267 (363)
The evacuation problem is usually addressed by assuming homogeneous media where pedestrians move freely in the presence of several exits and obstacles.
Severino F. Galán
doaj +1 more source
AUTOMATED EXTRACTION OF LIVER OUTLINES FROM COMPUTED TOMOGRAPHY SCAN IMAGES USING A CUDA-BASED SEGMENTATION METHOD [PDF]
The traditional fast marching algorithm for segmentation of the liver is suitable for processing on the central processing unit (CPU) platform, however, it is not suitable for implementation on Graphics Processing Unit (GPU).
Y. Chen, D. Li, Q. Zhu, C. Wang, J. Li
doaj +1 more source
Fast Methods for Eikonal Equations: An Experimental Survey
Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in time units) solving the Eikonal equation. Since fast marching was proposed in 1995, it has been applied to many different applications, such as robotics ...
J. V. Gomez +3 more
doaj +1 more source
A low complexity algorithm for non-monotonically evolving fronts [PDF]
A new algorithm is proposed to describe the propagation of fronts advected in the normal direction with prescribed speed function F. The assumptions on F are that it does not depend on the front itself, but can depend on space and time.
Nave, Jean-Christophe, Tcheng, Alexandra
core +1 more source
Marching Cubes and Histogram Pyramids for 3D Medical Visualization
This paper aims to implement histogram pyramids with marching cubes method for 3D medical volumetric rendering. The histogram pyramids are used for feature extraction by segmenting the image into the hierarchical order like the pyramid shape.
Porawat Visutsak
doaj +1 more source
Fast convergence layout algorithm for drawing graphs in marching-graph [PDF]
Marching-Graph is a new visualization that integrates the graph metaphor and the spatial metaphor into a single visualization. It provides users with highly interactive maps for accessing the logical structures of information that has the geographical ...
Huang, ML, Quan, W
core +1 more source
Two Fast Marching Methods for Hamilton–Jacobi Equations [PDF]
AbstractWe introduce and analyze two new Fast Marching (FM) methods based on a semi‐Lagrangian (SL) approximation (see [2] for a more complete presentation). The Characteristics driven Fast Marching method accepts more than one node at every iteration using a dynamic condition which leads to a faster convergence.
CRISTIANI, Emiliano, FALCONE, Maurizio
openaire +1 more source
Fast Marching Methods for Indefinite and Anisotropic Metrics [PDF]
In this thesis two different variants of the Fast-Marching-Method (FMM) are discussed. The first variant is an extension of the Generalized-Fast-Marching-Method to unstructured triangulations. We preserve the analytic properties as far as possible. Likewise to the GFMM there also is a modification which preserves the monotonicity.
Thomas Satzger
openalex +2 more sources
A Modified Fast Marching Method [PDF]
In most, if not all fast marching methods published hitherto, the input cost function and the output arrival time are sampled on exactly the same grid. But since the input data samples are differences of the output samples we found it natural to separate the input and output grid half a sampling unit in all coordinates (two or three).We also employ 8 ...
Per-Erik Danielsson, Qingfen Lin
openaire +1 more source
El level set method es una técnica que se utiliza habitualmente para describir matemáticamente la propagación de superficies mediante la aproximación y resolución de ecuaciones diferenciales.
Vicente Francisco González Albuixech +2 more
doaj +1 more source

