Linear Size Binary Space Partitions for Uncluttered Scenes

On visible surface generation by a priori tree structures

Henry Fuchs, Zvi M. Kedem, Bruce Naylor · 1980 · 698 citations · Full text

Computing, Computer Science, Visualization +17

An optimal algorithm for approximate nearest neighbor searching

Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 1994 · 600 citations

Computing, Computer Science, Algorithms +9

A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields

Paul B. Callahan, S. Rao Kosaraju · Journal of the ACM · 1995 · 555 citations · Full text

Computing, Computer Science, Algorithms +8

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas Guibas, John Hershberger, Daniel Leven et al. · Algorithmica · 1987 · 508 citations

Computing, Computer Science, Mathematics +16

Visibility preprocessing for interactive walkthroughs

Seth Teller, Carlo H. Séquin · 1991 · 403 citations

Computing, Visualization, Digital Rendering +8