#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jonathan Richard Shewchuk
- WACG
- 1996

A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Severalâ€¦ (More)

The Conjugate Gradient Method is the most prominent iterative method for solving sparse systems of linear equations. Unfortunately, many textbook treatments of the topic are written with neitherâ€¦ (More)

- Jonathan Richard Shewchuk
- Discrete & Computational Geometry
- 1997

Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementation of geometric algorithms. This report has three purposes. The first is to offer fastâ€¦ (More)

- Jonathan Richard Shewchuk
- Comput. Geom.
- 2002

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â€¦ (More)

- Jonathan Richard Shewchuk
- Symposium on Computational Geometry
- 1998

Given a complex of vertices, constraining segments, and planar straight-line constraining facets in E3, with no input angle less than 90 , an algorithm presented herein can generate a conforming meshâ€¦ (More)

Delaunay refinement is a technique for generating unstructured meshes of triangles or tetrahedra suitable for use in the finite element method or other numerical methods for solving partialâ€¦ (More)

- FranÃ§ois Labelle, Jonathan Richard Shewchuk
- Symposium on Computational Geometry
- 2003

We introduce <i>anisotropic Voronoi diagrams</i>, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which long, skinnyâ€¦ (More)

- FranÃ§ois Labelle, Jonathan Richard Shewchuk
- ACM Trans. Graph.
- 2007

The <i>isosurface stuffing</i> algorithm fills an isosurface with a uniformly sized tetrahedral mesh whose dihedral angles are bounded between 10.7° and 164.8°, or (with a change inâ€¦ (More)

- Jonathan Richard Shewchuk
- IMR
- 2002

When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise linear approximation of a function, the accuracy of the approximation depends on the sizes and shapes of theâ€¦ (More)

When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise linear approximation of a function, the accuracy of the approximation depends on the sizes and shapes of theâ€¦ (More)