Delaunay refinement algorithms for triangular mesh generation
Reads0
Chats0
TLDR
An intuitive framework for analyzing Delaunay refinement algorithms is presented that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and helps to solve the difficult problem of meshing nonmanifold domains with small angles.Abstract:
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanifold domains with small angles Although small angles inherent in the input geometry cannot be removed, one would like to triangulate a domain without creating any new small angles Unfortunately, this problem is not always soluble A compromise is necessary A Delaunay refinement algorithm is presented that can create a mesh in which most angles are 30^o or greater and no angle is smaller than arcsin[(3/2)sin(@f/2)]~(3/4)@f, where @f=<60^ois the smallest angle separating two segments of the input domain New angles smaller than 30^o appear only near input angles smaller than 60^o In practice, the algorithm's performance is better than these bounds suggest Another new result is that Ruppert's analysis technique can be used to reanalyze one of Chew's algorithms Chew proved that his algorithm produces no angle smaller than 30^o (barring small input angles), but without any guarantees on grading or number of triangles He conjectures that his algorithm offers such guarantees His conjecture is conditionally confirmed here: if the angle bound is relaxed to less than 265^o, Chew's algorithm produces meshes (of domains without small input angles) that are nicely graded and size-optimalread more
Citations
More filters
Journal ArticleDOI
X-ray imaging and analysis techniques for quantifying pore-scale structure and processes in subsurface porous medium systems
TL;DR: X-ray microtomographic imaging is a non-destructive technique for quantifying these processes in three dimensions within individual pores, and as reported here, with rapidly increasing spatial and temporal resolution.
Journal ArticleDOI
Three‐dimensional modelling and inversion of dc resistivity data incorporating topography – II. Inversion
TL;DR: In this paper, a triple-grid inversion technique based on unstructured tetrahedral meshes and finite-element forward calculation is presented for the determination of resistivity structures associated with arbitrary surface topography.
Proceedings Article
Programming sensor networks using abstract regions
Matt Welsh,Geoff Mainland +1 more
TL;DR: The goal is to simplify application design by providing a set of programming primitives for sensor networks that abstract the details of low-level communication, data sharing, and collective operations, and the implementation of abstract regions in the TinyOS programming environment are presented.
Journal ArticleDOI
Review of Output-Based Error Estimation and Mesh Adaptation in Computational Fluid Dynamics
TL;DR: Recent adaptive results from a variety of laminar and Reynolds-averaged Navier-Stokes applications show the power of output-based adaptive methods for improving the robustness of computational fluid dynamics computations, however, challenges and areas of additional future research remain.
Journal ArticleDOI
Continental scale, high order, high spatial resolution, ice sheet modeling using the Ice Sheet System Model (ISSM)
Eric Larour,Helene Seroussi,Helene Seroussi,Mathieu Morlighem,Mathieu Morlighem,Eric Rignot,Eric Rignot +6 more
TL;DR: In this article, the authors present a new thermomechanical finite element model of ice flow named ISSM (Ice Sheet System Model) that includes higher-order stresses, high spatial resolution capability and data assimilation techniques to better capture ice dynamics and produce realistic simulations of ice sheet flow at the continental scale.
References
More filters
Book
Computational Geometry: Algorithms and Applications
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Book ChapterDOI
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
TL;DR: Triangle as discussed by the authors is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunayer refinement algorithm for quality mesh generation, and it is shown that the problem of triangulating a planar straight line graph (PSLG) without introducing new small angles is impossible for some PSLGs.
Journal ArticleDOI
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
Journal ArticleDOI
Two algorithms for constructing a Delaunay triangulation
Der-Tsai Lee,Bruce Schachter +1 more
TL;DR: This paper provides a unified discussion of the Delaunay triangulation and two algorithms are presented for constructing the triangulations over a planar set ofN points.
Journal ArticleDOI
Primitives for the manipulation of general subdivisions and the computation of Voronoi
Leonidas J. Guibas,Jorge Stolfi +1 more
TL;DR: The following problem is discussed: given n points in the plane (the sites) and an arbitrary query point q, find the site that is closest to q, which can be solved by constructing the Voronoi diagram of the griven sites and then locating the query point in one of its regions.