This paper presents a new approach for constructing a consistent (non-manifold) mesh based on non-binary datasets. Mesh generation is the method of choice if a surface is extracted based on labeled volumetric datasets. In most cases, the traditional Marching Cubes algorithm or one of its extensions is applied for generating meshes of binary labeled input data. However, for different – especiall...

A new concept called a boat-sail distance is introduced on the surface of water with flow, and it is used to define a generalized Voronoi diagram, in such a way that the water surface is partitioned into regions belonging to the nearest harbors with respect to this distance. The problem of computing this Voronoi diagram is reduced to a boundary value problem of a partial differential equation, ...

A method for building a statistical shape model of sulci of the human brain cortex is described. The model includes sulcal fundi that are defined on a spherical map of the cortex. The sulcal fundi are first extracted in a semi-automatic way using an extension of the fast marching method. They are then transformed to curves on the unit sphere via a conformal mapping method that maps each cortica...

An adaptation of the fast marching method to the perspective Shape from Shading under frontal illumination is proposed. A heuristic is proposed to handle occlusion. The method outperforms Tankus et al. [Tankus, A., Sochen, N., Yeshurun, Y., 2005. Shape-from-shading under perspective projection. Internat. J. Comput. Vision 63(1), 21–43] in both time and accuracy. Accurate methods for generating ...

We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance in the properties of the data sets a two level approach using implicit active contours is chosen for the task. A fast pre-segmentation using the fast marching method followed by propagation of a sparse field level set allows a r...

We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian’s Fast Marching Method and Polthier’s straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. r 2005 Elsevier Ltd. All rights reserved.

We consider the problem of partitioning an area in the plane populated by a team of aerial/marine vehicles into a finite collection of non-overlapping sets. The sets of this partition are in an one-to-one correspondence with the vehicles under the following rule: each point in the given set of the partition can be reached by the corresponding vehicle in this set faster than any other vehicle in...

In this paper we present a new interactive method for tubular structure extraction. The main application and motivation for this work is vessel tracking in 2D and 3D images. The basic tools are minimal paths solved using the fast marching algorithm. This allows interactive tools for the physician by clicking on a small number of points in order to obtain a minimal path between two points or a s...

The cquatioii for steady two-dimcnsional mountain w a ~ c s is csprcsscd in the isentropic coordinates. An elliptic equation for thc fiiiitc ainplitudc vertical motion ficld is solved by a numerical marching schemc in atmospheres with varying shcar and stability.