#### Filter Results:

- Full text PDF available (29)

#### Publication Year

1996

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Patrick M. Knupp
- SIAM J. Scientific Computing
- 2001

Quality metrics for structured and unstructured mesh generation are placed within an algebraic framework to form a mathematical theory of mesh quality metrics. The theory, based on the Jacobian and related matrices, provides a means of constructing, classifying, and evaluating mesh quality metrics. The Jacobian matrix is factored into geometrically… (More)

- Patrick M. Knupp
- IMR
- 1998

Placement of interior node points is a crucial step in the generation of quality meshes in sweeping algorithms. Two new algorithms were devised for node point placement and implemented in Sweep Tool, the first based on the use of linear transformations between bounding node loops and the second based on smoothing. Examples are given that demonstrate the… (More)

- Lori A. Freitag, Patrick M. Knupp, Patrick M. Knupp
- 2002

We present a new shape measure for tetrahedral elements that is optimal in that it gives the distance of a tetrahedron from the set of inverted elements. This measure is constructed from the condition number of the linear transformation between a unit equilateral tetrahedron and any tetrahedron with positive volume. Using this shape measure, we formulate… (More)

- Mohamed S. Ebeida, Andrew A. Davidson, Anjul Patney, Patrick M. Knupp, Scott A. Mitchell, John D. Owens
- ACM Trans. Graph.
- 2011

We solve the problem of generating a uniform Poisson-disk sampling that is both <b>maximal</b> and <b>unbiased</b> over bounded non-convex domains. To our knowledge this is the first provably correct algorithm with time and space dependent only on the number of points produced. Our method has two phases, both based on classical dart-throwing. The first… (More)

- Lori A. Diachin, Patrick M. Knupp
- IMR
- 1999

We present a new shape measure for tetrahedral elements that is optimal in the sense that it gives the distance of a tetrahedron from the set of inverted elements. This measure is constructed from the condition number of the linear transformation between a unit equilateral tetrahedron and any tetrahedron with positive volume. We use this shape measure to… (More)

A procedure is presented to improve the quality of surface meshes while maintaining the essential characteristics of the discrete surface. The surface characteristics are preserved by repositioning mesh vertices in a series of element-based local parametric spaces such that the vertices remain on the original discrete surface. The movement of the mesh… (More)

- Patrick M. Knupp
- Engineering with Computers
- 2001

We investigate a well-motivated mesh untangling objective function whose optimization automatically produces non-inverted elements when possible. Examples show the procedure is highly effective on tetrahedral meshes and on many hexahedral meshes constructed via mapping or sweeping algorithms.

- Patrick M. Knupp
- SIAM J. Scientific Computing
- 1996

- Patrick M. Knupp
- IMR
- 1999