An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its appl...

A b s t r a c t . Interpolation of 3D segments obtained through a trinocular stereo process is achieved by using a 2D Delannay triangulation on the image plane of one of the vision system cameras. The resulting two-dimensional triangulation is backprojected into the 3D space, generating a surface description in terms of triangular faces. The use of a constrained Delaunay triangulation in the im...

This paper proposes a new heuristic locally determined algorithm for the triangulation between points sequences representing serial sections of a surface. Moreover, a strategy for surface area estimation based on triangulation of cross sectional contours is described, where each contour is represented by its sequence of vertices of maximal digital straight segments (DSS), or by its minimal leng...

In this paper, we establish two necessary conditions for a joint triangulation of two sets of n points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in O(n) time. For the problem of a joint triangulation of two simple polygons of n vertices, we propose an O(n) time algorithm for constructing a joint triangulation using dynamic progra...

This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...