In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
Yang-Soo Kim, Dong-Gyu Park, Ho-Youl Jung, Hwan-Gu...
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kr...
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 me...
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...