The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy....

The main motivation of this work is the problem of compute intersection curve between two surface. The surface/surface intersection, is a fundamental problem in computational geometry and geometric modelling of complex shapes. In general surface intersections, the most commonly used methods include subdivision and marching. Marching-based algorithms begin by finding a starting point on the inte...

Several participating media rendering algorithms are based on ray marching: they integrate the variations of radiance along the volume covered by the participating media by splitting the path of light into segments and sampling light contribution at each of those segments. This paper revisits the concept of ray marching not as an integration technique, but as the application of a numerical meth...

The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values g...