Computation of spatial skyline points | 1 | 0.35 | 2021 |
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies. | 0 | 0.34 | 2016 |
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280. | 0 | 0.34 | 2014 |
Frontiers in algorithmics. | 5 | 0.54 | 2014 |
Almost all Delaunay triangulations have stretch factor greater than pi/2 | 3 | 0.47 | 2011 |
Reconstructing polygons from scanner data | 10 | 0.84 | 2011 |
Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010 | 36 | 2.57 | 2010 |
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree | 43 | 1.55 | 2010 |
Computation of non-dominated points using compact voronoi diagrams | 2 | 0.36 | 2010 |
Maximum geodesic routing in the plane with obstacles | 0 | 0.34 | 2010 |
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development. | 8 | 0.58 | 2009 |
On Finding Non-dominated Points using Compact Voronoi Diagrams | 0 | 0.34 | 2009 |
Reducing the memory required to find a geodesic shortest path on a large mesh | 4 | 0.40 | 2009 |
Bio-geometry: challenges, approaches, and future opportunities in proteomics and drug discovery | 0 | 0.34 | 2008 |
Faraway Point: A Senitel Point For Delaunay Computation | 2 | 0.37 | 2008 |
How long can a graph be kept planar? | 2 | 0.43 | 2008 |
Terrain Representation using Right-Triangulated Irregular Networks | 2 | 0.40 | 2007 |
Defining and computing optimum RMSD for gapped multiple structure alignment | 0 | 0.34 | 2007 |
Maintaining solvent accessible surface area under rotamer substitution for protein design. | 2 | 0.39 | 2007 |
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids. | 49 | 3.33 | 2007 |
Artifacts caused by simplicial subdivision | 23 | 1.18 | 2006 |
VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation | 1 | 0.37 | 2006 |
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm | 17 | 0.88 | 2006 |
Sphere-based Computation of Delaunay Diagrams on Points from 4d Grids | 0 | 0.34 | 2006 |
Illustrating the streaming construction of 2D delaunay triangulations | 1 | 0.37 | 2006 |
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope | 2 | 0.41 | 2006 |
Rotamer-pair energy calculations using a trie data structure | 3 | 0.52 | 2005 |
Maximum Independent Set for Intervals by Divide-Prune-and-Conquer | 0 | 0.34 | 2005 |
Probik: Protein Backbone Motion by Inverse Kinematics. | 4 | 0.47 | 2005 |
Delineating Boundaries for Imprecise Regions | 12 | 0.81 | 2005 |
Polygonal path simplification with angle constraints | 9 | 0.69 | 2005 |
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification | 1 | 0.39 | 2005 |
Implementing time-varying contour trees | 1 | 0.36 | 2005 |
Banana spiders: A study of connectivity in 3d combinatorial rigidity | 3 | 0.40 | 2004 |
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 | 30 | 4.92 | 2004 |
Simplifying Flexible Isosurfaces Using Local Geometric Measures | 84 | 3.22 | 2004 |
A 2-chain can interlock with a k-chain | 1 | 0.43 | 2004 |
Binary compression rates for ASCII formats | 4 | 0.50 | 2003 |
Path seeds and flexible isosurfaces using topology for exploratory visualization | 34 | 1.45 | 2003 |
Large Mesh Simplification using Processing Sequences | 56 | 1.97 | 2003 |
Ununfoldable polyhedra with convex faces | 21 | 2.18 | 2003 |
Interlocked open and closed linkages with few joints | 4 | 1.00 | 2003 |
Approximating the geometric minimum-diameter spanning tree. | 2 | 0.37 | 2003 |
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions | 25 | 1.33 | 2002 |
Some Aperture-Angle Optimization Problems | 4 | 0.53 | 2002 |
Algorithmic issues in modeling motion | 30 | 1.96 | 2002 |
Coding with ASCII: compact, yet text-based 3D content | 6 | 0.76 | 2002 |
Testing Homotopy for paths in the plane | 36 | 1.41 | 2002 |
Heaphull? | 0 | 0.34 | 2001 |
Counting triangulations and pseudo-triangulations of wheels | 15 | 1.01 | 2001 |