Marching cubes is a simple and popular method for extracting iso-surfaces from implicit functions or discrete three-dimensional (3-D) data. However, it does not guarantee the surface to be topologically consistent with the data, and it creates triangulations which contain many triangles of poor aspect ratio. Marching tetrahedra is a variation of marching cubes, which overcomes this topological ...

1 Abstract A method is presented to extract space curves, deened by diierential invariants, at increasing scales. The curves are considered as the intersection of two iso-surfaces in 3D, so their moving paths or orbits can be explicitly obtained in scale space as the intersection of two iso-surfaces in 4D. This method is based on a novel algorithm to search for iso-surfaces and their intersecti...

A numerical approach is presented for an inequality problem arising in the earthquake analysis of adjacent buildings. This problem concerns the unilateral contact-impact between neighboring buildings, when friction and P-delta effects are taken into account. The proposed numerical approach is based on a double discretization, in space and time, and on optimization methods. First, the Finite Ele...

A new method is proposed to automatically segment out a person's face from a given sequence of images that consists of a head-and-shoulder view, using the Fast Marching Level Set approach. The method proposed here involves a fast, reliable and computationally efficient algorithm, which exploits the colour information in an image to segment the face region. The colour information is derived and ...

This paper describes a technique used to approximate the surface of an object’s visual hull. The hull’s basic structure is initially represented by a partitioned 3D space using voxels. The marching cubes algorithm then assigns polygonal patches to surface voxels depending on a certain criteria. It is less computationally intensive to manipulate a few triangular patches than a number of six-face...

The advancement of robotics in recent years has driven the growth robotic applications for more complex tasks requiring manipulation capabilities. Recent works have focused on adapting learning methods to which are stochastic and may not converge. In this paper, a kinesthetic method based fast marching square is presented. This poses great advantages such as ensuring convergence from experience...

Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the depth values. In this paper, we introduce a fast and efficient method for computing the depth values from surface normal vectors. The method is based on solving the Eikonal equation using Fast Marching Method. We introduc...

We derive a Godunov-type numerical flux for the class of strictly convex, homogeneous Hamiltonians that includes H(p; q) = pap2 + bq2 2 pq; 2 < ab: We combine our Godunov numerical fluxes with a simple GaussSeidel type iterations for solving the corresponding Hamilton-Jacobi Equations. The resulting algorithm is fast since it does not require a sorting strategy as does the fast marching method....