Delaunay Refinement by Corner Lopping
نویسندگان
چکیده
An algorithm for quality Delaunay meshing of 2D domains with curved boundaries is presented. The algorithm uses Ruppert’s “corner lopping” heuristic [MR96b:65137]. In addition to admitting a simple termination proof, the algorithm can accept curved input without any bound on the tangent angle between adjoining curves. In the limit case, where all curves are straight line segments, the algorithm returns a mesh with a minimum angle of arcsin 1/2 √ 2 , except “near” input corners. Some loss of output quality is experienced with the use of curved input, but this loss is diminished for smaller input curvature.
منابع مشابه
Parallel 2D Graded Guaranteed Quality Delaunay Mesh Refinement
We develop a theoretical framework for constructing guaranteed quality Delaunay meshes in parallel for general two-dimensional geometries. This paper presents a new approach for constructing graded meshes, i.e., meshes with element size controlled by a user-defined criterion. The sequential Delaunay refinement algorithms are based on inserting points at the circumcenters of triangles of poor qu...
متن کاملScalable Macromodeling of Microwave Systems Responses using Sequential Sampling with Path-Simplexes
Introduction: Efficient design of electromagnetic (EM) systems often requires expensive simulations using EM solvers which normally provide high accuracy at a significant cost in terms of memory storage and computing time. Alternatively, scalable macromodels can be used, which approximate the complex behavior of EM systems, characterized by frequency and additional design parameters, such as ge...
متن کاملDelaunay refinement for curved complexes
This work investigates the Delaunay refinement for curved complexes. A manifold complex is defined as an unambiguous representation for the geometric objects required by a partial differential equation solver. The Chew’s and Ruppert’s Delaunay refinement algorithms, including an extension for curved complexes, are described under a new and arbitrary dimensional perspective. A theorem for strong...
متن کامل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...
متن کاملCollars and Intestines: Practical Conforming Delaunay Refinement
While several existing Delaunay refinement algorithms allow acute 3D piecewise linear complexes as input, algorithms producing conforming Delaunay tetrahedralizations (as opposed to constrained or weighted Delaunay tetrahedralizations) often involve cumbersome constructions and are rarely implemented. We describe a practical construction for both “collar” and “intestine”-based approaches to thi...
متن کامل