Steven E. Pav

According to our database, Steven E. Pav authored at least 7 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An Iterative Algorithm for Regularized Non-negative Matrix Factorizations.

Steven E. Pav

CoRR, 2024

2005

When and why delaunay refinement algorithms work.

Gary L. Miller, Steven E. Pav, Noel Walkington

Int. J. Comput. Geom. Appl., 2005

Delaunay Refinement by Corner Lopping.

Steven E. Pav, Noel Walkington

Proceedings of the 14th International Meshing Roundtable, 2005

2004

Robust Three Dimensional Delaunay Refinement.

Steven E. Pav, Noel Walkington

Proceedings of the 13th International Meshing Roundtable, 2004

An anisotropic cardinality bound for triangulations.

Steven E. Pav

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

When and Why Ruppert's Algorithm Works.

Gary L. Miller, Steven E. Pav, Noel Walkington

Proceedings of the 12th International Meshing Roundtable, 2003

2002

Fully Incremental 3D Delaunay Refinement Mesh Generation.

Gary L. Miller, Steven E. Pav, Noel Walkington

Proceedings of the 11th International Meshing Roundtable, 2002