Jonathan Richard Shewchuk  Home/Search
Context
Related
| berkeley.edu/~jrs/papers/2dj.ps Cached: PS.gz PS PDF DjVu Image Update Help From: cmu.edu/~jrs/jrspapers (more) Homepages: J.Shewchuk HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
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... (Update)
Similar documents (at the sentence level):
17.1%: Lecture Notes on Delaunay Mesh Generation - Shewchuk (1999) (Correct)
7.4%: Mesh Generation for Domains with Small Angles - Shewchuk (Correct)
Active bibliography (related documents): More All
0.6: Mesh Generation - Bern, Plassmann (2000) (Correct)
0.6: Updating and Constructing Constrained Delaunay and - Constrained Regular.. (Correct)
0.4: Tetrahedral Mesh Generation by Delaunay Refinement - Shewchuk (1998) (Correct)
Similar documents based on text: More All
0.5: Stabbing Delaunay Tetrahedralizations - Shewchuk (2000) (Correct)
0.4: Functional Delaunay Refinement - Li (2000) (Correct)
0.4: Parallel Delaunay Refinement: - Algorithms And Analyses (Correct)
BibTeX entry: (Update)
@misc{ shewchuk-delaunay,
author = "Jonathan Richard Shewchuk",
title = "Delaunay Refinement Algorithms for Triangular Mesh Generation",
url = "citeseer.nj.nec.com/shewchuk01delaunay.html" }
Citations (may not include all citations):272 Applications of Random Sampling in Computational Geometry - Clarkson, Shor - 1989
223 Primitives for the Manipulation of General Subdivisions and .. (context) - Guibas, Stolfi - 1985
98 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
93 Provably Good Mesh Generation - Bern, Eppstein et al. - 1994
76 the Angle Condition in the Finite Element Method (context) - Babuska, Aziz - 1976
70 Constrained Delaunay Triangulations (context) - Chew - 1989
58 Quality Mesh Generator and Delaunay Triangulator (context) - Shewchuk, Engineering - 1996
49 Two Algorithms for Constructing a Delaunay Triangulation (context) - Lee, Schachter - 1980
48 dimensional Delaunay Tessellation with Application to Vorono.. (context) - Watson, n- - 1981
47 Backwards Analysis of Randomized Geometric Algorithms - Seidel - 1992
44 Computing Dirichlet Tessellations (context) - Bowyer - 1981
39 A Delaunay Based Numerical Method for Three Dimensions: Gene.. - Miller, Talmor et al. - 1995
35 A New and Simple Algorithm for Quality 2-Dimensional Mesh Ge.. (context) - Ruppert - 1992
27 Generalized Delaunay Triangulations for Planar Graphs (context) - Lee, Lin - 1986
24 Computing in Euclidean Geometry (context) - Bern, Eppstein et al. - 1992
21 A Faster Divide-and-Conquer Algorithm for Constructing Delau.. (context) - Dwyer - 1987
16 Mathematical Software III (context) - Lawson, Interpolation - 1977
10 Finite Elements: Computational Aspects (context) - Carey, Oden - 1984
9 Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes - Miller, Talmor et al. - 1997
7 On Deletion in Delaunay Triangulations - Devillers - 1999
7 Selective Refinement: A New Strategy for Automatic Node Plac.. (context) - Frey - 1987
6 On Good Triangulations in Three Dimensions (context) - Dey, Bajaj et al. - 1992
5 Discrete and Computational Geometry (context) - Baker, Grosse et al. - 1988
5 Cardinality Bounds for Triangulations with Bounded Minimum A.. - Mitchell - 1994
4 Adaptive Refinement of Unstructured Finite-Element Meshes - Jones, Plassmann - 1997
2 Journal of Algorithms (context) - Refinement, Quality et al. - 1995
2 Department of Computer Science (context) - Meshes, TR- - 1989
Documents on the same site (http://www-2.cs.cmu.edu/~jrs/jrspapers.html): More
What Is a Good Linear Finite Element? - Interpolation.. - Shewchuk (2002) (Correct)
Constrained Delaunay Tetrahedralizations and Provably Good.. - Shewchuk (Correct)
Two Discrete Optimization Algorithms for the - Topological Improvement Of (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute