Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offe...

Robot motion is nowadays studied from a lot of different perspectives. This paper is based on the assumption of a fully known environment, allowing the supervisor to plan the robot trajectory before the actual motion. The auxiliary structure we mainly use is the Delaunay triangulation. We analyze the implementation details, as well as the limits of the geometrical model we use.

This paper presents a technique of incorporating anisotropic metric into the Delaunay triangulation algorithm for unstructured mesh generation on 3D parametric surfaces. Both empty circumcircle and inner angles criteria of Delaunay retriangulation can be successfully used with the developed method of coordinate transformation with little adjustments. We investigate the efficiency of mesh genera...

This paper discusses an elliptical pad structure and its polygonal approximation. The elliptical pad is a part of via model structures, which are important and critical components on today’s multilayered Printed Circuit Board (PCB) and electrical packaging. To explore meshing characterization of the elliptical pad helps mesh generation over 3D structures for electromagnetic modeling (EM) and si...

Surface triangular meshing plays an important role in the areas of computer graphics and engineering analysis. Traditionally, surface meshing is achieved by mapping meshes created in 2D parametric space onto surfaces. Care is taken in generating meshes in the parametric space and mapping them to surfaces because the transformation of geometry from the parameter space to the real space could be ...

Delaunay triangulation and its dual structure Voronoi diagram represent a multi-purpose data structures which are widely used in computational geometry. Using these structures for sets of moving data is also relatively well-known and the general approaches have already been discovered. This paper focuses on the rarely discussed problem computing of the topological events e.g. the exact times of...