Size-optimal Steiner points for Delaunay-refinement on curved surfaces

نویسندگان

  • Darren Engwirda
  • David Ivers
چکیده

An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is shown that the use of off-centre Steiner points, positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in the shapeand size-quality of the resulting surface tessellations. The new algorithm can be viewed as a Frontal-Delaunay approach – a hybridisation of conventional Delaunay-refinement and advancingfront techniques in which new vertices are positioned to satisfy both element size and shape constraints. The performance of the new scheme is investigated experimentally via a series of comparative studies that contrast its performance with that of a typical Delaunay-refinement technique. It is shown that the new method inherits many of the best features of classical Delaunay-refinement and advancing-front type methods, leading to the construction of smooth, high quality surface triangulations with bounded radius-edge ratios and convergence guarantees. Experiments are conducted using a range of complex benchmarks, verifying the robustness and practical performance of the proposed scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Safe Steiner Points for Delaunay Refinement

In mesh refinement for scientific computing or graphics, the input is a description of an input geometry, and the problem is to produce a set of additional “Steiner” points whose Delaunay triangulation respects the input geometry, and whose points are well-spaced. Ideally, we would like the minimum output size – as few Steiner points as possible. Ruppert showed how to come within a constant fac...

متن کامل

What makes a good Steiner point?

In mesh refinement for scientific computing or graphics, the input is a description of an input geometry, and the problem is to produce a set of Steiner points whose Delaunay triangulation respects the input geometry, and whose points are well-spaced in the technical sense. Ideally, we would like the minimum output size – as few Steiner points as possible. Ruppert showed how to come within a co...

متن کامل

O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations

We introduce a new type of Steiner points, called off-centers, as an alternative to circumcenters, to improve the quality of Delaunay triangulations. We propose a new Delaunay refinement algorithm based on iterative insertion of off-centers. We show that this new algorithm has the same quality and size optimality guarantees of the best known refinement algorithms. In practice, however, the new ...

متن کامل

Triangulations with locally optimal Steiner points

We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold angle α, the Delaunay refinement algorithms compute triangulations that have all angles at least α. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delauna...

متن کامل

A Template for Developing Next Generation Parallel Delaunay Refinement Methods

We describe a complete solution for both sequential and parallel construction of guaranteed quality Delaunay meshes for general two-dimensional geometries. We generalize the existing sequential point placement strategies for guaranteed quality mesh refinement: instead of a specific position for a new point, we derive two types of two-dimensional regions which we call selection disks. Both types...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1501.04002  شماره 

صفحات  -

تاریخ انتشار 2015