The intended audience of this book (and the combined two volumes especially) is quite
broad. It can be used in a variety of computer graphics courses or by those who are trying to …

We present an algorithm to reconstruct smooth surfaces of arbitrary topology from
unorganised sample points and normals. The method uses natural neighbour interpolation …

Triangulations in CGAL* Page 1 Triangulations in CGAL* [Extended Abstract] Jean Daniel
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …

To obtain a satisfied performance of wireless sensor network, an adaptable sensor
deployment method for various applications is essential. In this paper, we propose a …

Walking in a triangulation Page 1 Walking in a triangulation Olivier Devillers Sylvain Pion
Monique Teillaud ABSTRACT Given a triangulation in the plane or a tetrahedralization in 3-space …

This paper presents how the space of spheres and shelling may be used to delete a point
from a d-dimensional triangulation efficiently. In dimension two, if Ic is the degree of the …

We propose a new data structure to compute the Delaunay triangulation of a set of points in
the plane. It combines good worst case complexity, fast behavior on real data, small memory …

We present algorithms for the efficient insertion and removal of constraints in Delaunay
Triangulations. Constraints are considered to be points or any kind of polygonal lines …

Parallel digital image correlation (DIC) computation has been increasingly used in DIC
community due to the growing requirement on real-time deformation monitoring. In existing …

This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction
algorithm that holds the advantages of both Delaunay-based and region-growing …