In recent years, more 3D protein structures have become available, which has made the analysis of large molecular structures much easier. There is a strong demand for geometric models for the study of protein-related interactions. Alpha shape and Delaunay triangulation are powerful tools to represent protein structures and have advantages in characterizing the surface curvature and atom contact...

This paper compares three diierent node insertion strategies which can be used to incrementally construct Delaunay triangulation models. Delaunay networks may be used to eeciently store low dimensional nonlinear models, and can therefore be used in a wide range of real-time applications. However, there are no direct node selection methods, and it can be shown that the network's gener-alisation ...

Detection of moving objects in a video stream received from a moving camera is difficult computer vision task, because the motion of the camera blends with the motion of the objects in the scene. In order to tackle this problem, we propose a method based on optical flow calculation and Delaunay triangulation. Given a sequence of frames, firstly, we extract the corner feature points using ORB al...

Powar, P.L., Minimal roughness property of the Delaunay triangulation: a shorter approach, Computer Aided Geometric Design 9 (1992) 491-494. Recently Rippa (1990) has investigated an interesting result which states that “The Delaunay triangulation of the data points minimizes the roughness measure of a Piecewise Linear Interpolating Surface (PLISJ for any fixed set of function values”. This res...

Terrains are often modeled by triangulations. One of the criteria that a triangulation should have is “nice shape” triangles. Delaunay triangulation is a good way to formalize nice shape. Another criterion is reality of drainage in terrains. Natural terrains do not have many local minima and have drainage lines in the bottom of valleys. To achieve these characteristics, higher-order Delaunay tr...

We discuss Lepp-centroid versus Lepp-midpoint algorithms for Delaunay quality triangulation. We present geometrical results that ensure that the centroid version produces triangulations with both average smallest angles greater than those obtained with the midpoint version and with bigger smallest edges, without suffering from a rare looping case associated to the midpoint method. Empirical stu...