| Interactive Exploration and Visualization Using MetaTracts extracted from Carbon Fiber Reinforced Composites. | 0 | 0.34 | 2017 |
| Visualizing flow fields using fractal dimensions | 0 | 0.34 | 2016 |
| Exploring Flow Fields Using Space-Filling Analysis of Streamlines. | 4 | 0.39 | 2014 |
| The JS-graphs of Join and Split Trees | 0 | 0.34 | 2014 |
| Constructing isosurfaces with sharp edges and corners using cube merging | 3 | 0.51 | 2013 |
| On the Fractal Dimension of Isosurfaces | 13 | 0.69 | 2010 |
| A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes | 18 | 0.92 | 2010 |
| Isotopic reconstruction of surfaces with boundaries | 10 | 0.57 | 2009 |
| Quality isosurface mesh generation using an extended marching cubes lookup table | 15 | 0.65 | 2008 |
| A Delaunay Simplification Algorithm for Vector Fields | 5 | 0.43 | 2007 |
| Stability of Critical Points with Interval Persistence | 18 | 1.12 | 2007 |
| Constructing pairwise disjoint paths with few links | 6 | 0.64 | 2007 |
| Anisotropic surface meshing | 11 | 0.85 | 2006 |
| Contour area filtering of two-dimensional electrophoresis images. | 0 | 0.34 | 2006 |
| Time-varying interval volumes | 3 | 0.37 | 2005 |
| Isosurface construction in any dimension using Convex Hulls. | 29 | 1.17 | 2004 |
| Volume Interval Segmentation and Rendering | 5 | 0.41 | 2004 |
| Fast Reconstruction Of Curves With Sharp Corners | 17 | 0.75 | 2002 |
| Reconstruction curves with sharp corners | 29 | 2.00 | 2001 |
| Undersampling and oversampling in sample based shape modeling | 7 | 0.90 | 2001 |
| A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets | 1 | 0.48 | 2001 |
| On the Helly Number for Hyperplane Transversals to Unit Balls | 5 | 1.01 | 2000 |
| Isosurfacing in higher dimensions | 38 | 1.36 | 2000 |
| Hyperplane depth and nested simplices | 5 | 0.63 | 1998 |
| Randomized Quickhull | 5 | 0.64 | 1997 |
| Constructing piecewise linear homeomorphisms of simple polygons | 14 | 1.12 | 1997 |
| Constructing piecewise linear homeomorphisms of polygons with holes | 10 | 0.98 | 1997 |
| On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution | 11 | 0.87 | 1997 |
| Optimization of a Class of Multi-Dimensional Integrals on Parallel Machines | 13 | 0.81 | 1997 |
| Bounding the number of geometric permutations induced by k-transversals | 9 | 1.73 | 1996 |
| Optimal Reordering and Mapping of a Class of Nested-Loops for Parallel Execution | 5 | 0.62 | 1996 |
| On the Connected Components of the Space of Line Transersals t a Family of Convex Sets | 1 | 0.36 | 1995 |
| Every Arrangement Extends to a Spread | 1 | 0.41 | 1994 |
| There is a universal topological plane | 1 | 0.47 | 1992 |
| Extremal graphs with no C4's, C6's, or C10's | 14 | 1.29 | 1991 |
| Ordered Stabbing Of Pairwise Disjoint Convex-Sets In Linear Time | 1 | 0.36 | 1991 |
| Points and triangles in the plane and halving planes in space | 40 | 7.11 | 1990 |
| The combinatorial complexity of hyperplane transversals | 1 | 0.83 | 1990 |
| A generalization of Hadwiger's transversal theorem to intersecting sets | 11 | 1.51 | 1990 |
| Necessary and sufficient conditions for hyperplane transversals | 6 | 1.51 | 1990 |
| Upper Bounds on Geometric Permutations for Convex Sets | 25 | 1.98 | 1990 |
| Stabbing pairwise disjoint translates in linear time | 9 | 0.81 | 1989 |
| Polyhedral line transversals in space | 10 | 1.29 | 1988 |
| Algorithms for line transversals in space | 12 | 1.64 | 1987 |
