#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1981

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gary L. Miller, Dafna Talmor, S. Y. Teng, Noel Walkington
- STOC
- 1995

We present new geometrical and numerical analysis structure theorems for the Delaunay diagram of point sets in R~ for a fixed d where the point sets arise naturally in numerical methods. In… (More)

- Noel Walkington
- 1996

We propose a finite element algorithm for computing the motion of a surface moving by mean curvature. The algorithm uses the level set formulation, so that changes in topology of the surface can be… (More)

- Konstantinos Chrysafinos, Noel Walkington
- SIAM J. Numerical Analysis
- 2006

We analyze the classical discontinuous Galerkin method for a general parabolic equation. Symmetric error estimates for schemes of arbitrary order are presented. The ideas we develop allow us to relax… (More)

- Noel Walkington
- SIAM J. Numerical Analysis
- 2004

We consider linear first order scalar equations of the form ρt + div(ρv) + aρ = f with appropriate initial and boundary conditions. It is shown that approximate solutions computed using the… (More)

- Noel Walkington
- SIAM J. Numerical Analysis
- 2010

It is shown that for a broad class of equations that numerical solutions computed using the discontinuous Galerkin or the continuous Galerkin time stepping schemes of arbitrary order will inherit the… (More)

- Herbert Edelsbrunner, Xiuping Li, +5 authors Noel Walkington
- STOC
- 2000

A sliver is a tetrahedron whose four vertices lie close to a plane and whose perpendicular projection to that plane is a convex quadrilateral with no short edge. Slivers axe both undesirable and… (More)

- Gary L. Miller, Steven E. Pav, Noel Walkington
- IMR
- 2003

An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph (PSLG) input. The… (More)

- Béatrice Rivière, Noel Walkington
- SIAM J. Numerical Analysis
- 2011

- Steven E. Pav, Noel Walkington
- IMR
- 2004

The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with arbitrarily small angles, and outputs a Conforming Delaunay Tetrahedralization… (More)

- Alexander Rand, Noel Walkington
- IMR
- 2009

While several existing Delaunay refinement algorithms allow acute 3D piecewise linear complexes as input, algorithms producing conforming Delaunay tetrahedralizations (as opposed to constrained or… (More)