| VoroCrust: Voronoi Meshing Without Clipping | 0 | 0.34 | 2019 |
| Hierarchical control of a catoptric surface: work-in-progress. | 0 | 0.34 | 2018 |
| Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. | 1 | 0.35 | 2018 |
| Footprint Placement for Mosaic Imaging by Sampling and Optimization. | 0 | 0.34 | 2018 |
| VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). | 0 | 0.34 | 2018 |
| A Seed Placement Strategy for Conforming Voronoi Meshing. | 1 | 0.35 | 2017 |
| A Constrained Resampling Strategy for Mesh Improvement | 4 | 0.38 | 2017 |
| Nonoverlapping Grid-aligned Rectangle Placement for High Value Areas. | 0 | 0.34 | 2017 |
| All-quad meshing without cleanup. | 1 | 0.35 | 2017 |
| Disk Density Tuning of a Maximal Random Packing. | 5 | 0.40 | 2016 |
| Curve Reconstruction with Many Fewer Samples. | 1 | 0.35 | 2016 |
| POF-Darts: Geometric adaptive sampling for probability of failure. | 0 | 0.34 | 2016 |
| Improving spatial coverage while preserving the blue noise of point sets | 6 | 0.41 | 2014 |
| k-d Darts: Sampling by k-dimensional flat searches | 1 | 0.37 | 2014 |
| Spoke Darts for Efficient High Dimensional Blue Noise Sampling. | 2 | 0.40 | 2014 |
| Simple and Fast Interval Assignment Using Nonlinear and Piecewise Linear Objectives. | 0 | 0.34 | 2013 |
| Sifted Disks. | 0 | 0.34 | 2013 |
| A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions | 26 | 0.77 | 2012 |
| Variable Radii Poisson Disk Sampling. | 0 | 0.34 | 2012 |
| High-quality parallel depth-of-field using line samples | 9 | 0.46 | 2012 |
| Efficient maximal poisson-disk sampling. | 0 | 0.34 | 2011 |
| Efficient maximal poisson-disk sampling | 44 | 1.28 | 2011 |
| Uniform Random Voronoi Meshes. | 5 | 0.51 | 2011 |
| Efficient and good Delaunay meshes from random points | 15 | 0.70 | 2011 |
| Flexible approximate counting | 0 | 0.34 | 2011 |
| High Fidelity Interval Assignment | 20 | 4.41 | 2000 |
| The Cleave and Fill Tool: An All-Hexahedral Refinement Algorithm for Swept Meshes | 6 | 0.86 | 2000 |
| Methods for Multisweep Automation | 21 | 2.03 | 2000 |
| Quality Mesh Generation in Higher Dimensions | 38 | 5.62 | 2000 |
| The Graft Tool: An All-Hexahedral Transition Algorithm for Creating a Multi-Directional Swept Volume Mesh | 22 | 2.49 | 1999 |
| A Method for Controlling Skew on Linked Surfaces | 0 | 0.34 | 1999 |
| The All-Hex Geode-Template for Conforming a Diced Tetrahedral Mesh to any Diced Hexahedral Mesh | 11 | 1.85 | 1998 |
| The Geode Algorithm: Combining Hex/Tet Plastering, Dicing and Transition Elements for Automatic, All-Hex Mesh Generation | 5 | 1.06 | 1998 |
| Reliable Whisker Weaving via Curve Contraction | 35 | 5.00 | 1998 |
| Finding A Covering Triangulation Whose Maximum Angle Is Provably Small | 3 | 0.65 | 1997 |
| Choosing corners of rectangles for mapped meshing | 12 | 2.33 | 1997 |
| A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume | 42 | 7.27 | 1996 |
| An aspect ratio bound for triangulating a d-grid cut by a hyperplane (extended abstract) | 1 | 0.46 | 1996 |
| Hexahedral mesh generation via the dual | 3 | 0.55 | 1995 |
| Linear-size nonobtuse triangulation of polygons | 46 | 4.57 | 1995 |
| Cardinality Bounds for Triangulations with Bounded Minimum Angle | 13 | 4.24 | 1994 |
| Approximating the maxmin-angle covering triangulation | 2 | 0.62 | 1993 |
| Quality mesh generation in three dimensions | 60 | 22.61 | 1992 |
