IMPLICIT SURFACE TRIANGULATION WITH SAMPLING

This paper presents a new way for implicit rendering with particle systems. A seed particle needs to be found at first, which updates itself in a way of cube-finding. Other particles are initialized by this particle. We can set the number of particles. There are repulsion forces between the particles. They move in the direction of the forces, and update themselves in the way of cube-finding until they reach a uniform state. Then implicit surfaces get a steady and good sampling. A Crust mesh algorithm is used to connect the sampling points into triangle meshes. It is preferable to represent the surfaces with meshes rather than particles. Cube-finding method is absolutely convergent. The size of meshes varies with the topology of the surfaces. Experiments demonstrate this method is useful and efficiency.