#### Filter Results:

- Full text PDF available (140)

#### Publication Year

1988

2018

- This year (1)
- Last 5 years (13)
- Last 10 years (54)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

#### Organism

Learn More

- Ian W. Davis, Andrew Leaver-Fay, +8 authors David C. Richardson
- Nucleic Acids Research
- 2007

MolProbity is a general-purpose web server offering quality validation for 3D structures of proteins, nucleic acids and complexes. It provides detailed all-atom contact analysis of any stericâ€¦ (More)

- Hamish A. Carr, Jack Snoeyink, Ulrike Axen
- Comput. Geom.
- 2000

We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyalyi and of van Kreveldâ€¦ (More)

- John Hershberger, Jack Snoeyink
- WADS
- 1991

- Hamish A. Carr, Jack Snoeyink, Michiel van de Panne
- IEEE Visualization 2004
- 2004

The contour tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues forâ€¦ (More)

- Larry F. Palazzi, Jack Snoeyink
- WADS
- 1993

We simplify the red/blue segment intersection algorithm of Chazelle et al: Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O(n log n) time using O(n)â€¦ (More)

- Jack Snoeyink, Subhash Suri, George Varghese
- Computer Networks
- 2001

With the rapidly growing importance of multicast in the Internet there have been recent proposal, such as RFC 2627, for scalable key distribution such that when the nth user joins or leaves a group,â€¦ (More)

We analyze the line simpli cation algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls,â€¦ (More)

- Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
- Int. J. Comput. Geometry Appl.
- 1991

A linear time algorithm for minimum link paths inside a simple polygon. Algorithms for the reduction of the number of points required to represent a line or its caricature. Computing the visibilityâ€¦ (More)

- Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap
- SODA
- 1995

In this paper, we give an algorithm for output-sensitive construction of an j-face polytope that is defined by n halfspaces in E4. Our algorithm runs in O((n + f)log2 f) time and uses O(n + j) space.â€¦ (More)

- Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
- Symposium on Computational Geometry
- 2002

In this paper we present an efficient algorithm to test if two given paths are homotopic; that is, whether they wind around obstacles in the plane in the same way. For simple paths specified byâ€¦ (More)