Surface reconstruction is a common task in the modern computer graphics and computational geometry. Given a set of points P sampled from some unknown surface S, we have to create the triangle mesh… (More)

International Journal of Geographical Information…

2003

This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It belongs to the class of incremental insertion algorithms, which are known as less demanding from the… (More)

Given an input set of planar points, which occupy a non-convex polygon area, possibly with holes, we reconstruct the shape of its boundary domain, without previous knowledge of which points or edges… (More)

This paper describes two simple and efficient parallel algorithms for the construction of the Delaunay triangulation ðDTðSÞÞ in E by randomized incremental insertion. The construction of the DTðSÞ is… (More)

The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Ω(NlogN). In this paper, we describe… (More)

While it is usually not difficult to compute principal curvatures of a smooth surface of sufficient differentiability, it is a rather difficult task when only a polygonal approximation of the surface… (More)

There is a wide range of applications, such as solid modeling, computer graphics or computer vision, for which surface reconstruction of scattered data points in space is important. Many algorithms… (More)

This paper presents several parallel algorithms for the construction of the Delaunay triangulation in E and E—one of the fundamental problems in computer graphics. The proposed algorithms are… (More)