A mesh refinement and a mesh simplification algorithm are presented. Both algorithms guarantee a user-defined error tolerance and deliver a multiresolution model. After the computation of the multiresolution model triangulation of the surface patches at variable resolutions can be incrementally generated onthe-fly at rendering time. The resulting triangulations form hierarchical Delaunay triang...

Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF. This work proposes the first exact SIF algorithm and a heuristic SIF algorithm that compute min-cost multicast network coding for N (N ≥ 3) given termina...

The paper presents an algorithm of volume meshing by using the Advancing Front Technique (AFT) combined with the Delaunay Triangulation. The tetrahedronization starts with the surface mesh with the elements oriented towards the interior 3-D domain. The main idea is based upon AFT, with simultaneous points insertion and tetrahedra creation. The characteristic feature of the approach is the part ...

Filling holes of 3D models is an important and complicated process. In this paper, we introduce a new and robust method for filling complex holes in triangular mesh models. In order to fill separate holes, the boundary edges of a hole are smoothly arranged and then locally uniform new points are added to the hole. The new points are selected by minimizing a hole filling area. The Delaunay trian...

Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number k and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown to be plane 2-spanners of the 2D Euclid...