Matthew Dickerson, David Eppstein  Home/Search
Context Related
| uci.edu/~eppstein/...DicEppCGTA96.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pubs/all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present algorithms for five interdistance enumeration problems that take as input a set S of n points in IR d (for a fixed but arbitrary dimension d) and as output enumerate pairs of points in S satisfying various conditions. We present: an O(n log n + k) time and O(n) space algorithm that takes as additional input a distance # and outputs all k pairs of points in S separated by a distance of # or less; an O(n log n + k log k) time and O(n+k) space algorithm that enumerates in... (Update)
Similar documents based on text: More All
0.2: Iterated Nearest Neighbors and Finding Minimal Polytopes - Eppstein, Erickson (1994) (Correct)
0.2: Optimal Placement of Convex Polygons to Maximize Point.. - Dickerson, Scharstein (1996) (Correct)
0.2: On Triangulating Three-Dimensional Polygons - Barequet, Dickerson, Eppstein (1996) (Correct)
Related documents from co-citation: More All
5: A decomposition of multi-dimensional point sets with applications to k-nearest-n.. - Callahan, Kosaraju - 1992
4: Enumerating interdistances in space (context) - Salowe - 1992
4: Spanning trees short or small - Ravi, Sundaram et al.
BibTeX entry: (Update)
M.T. Dickerson, D. Eppstein, "Algorithms for proximity problems in higher dimensions", Computational Geometry: Theory and Applications 5, 277--291, 1996. http://citeseer.ist.psu.edu/258426.html More
@article{ dickerson96algorithms,
author = "Matthew T. Dickerson and David Eppstein",
title = "{Algorithms for proximity problems in higher dimensions}",
journal = "Computational Geometry Theory and Applications",
volume = "5",
pages = "277--291",
year = "1996",
url = "citeseer.ist.psu.edu/258426.html" }
Citations (may not include all citations):174 Time bounds for selection (context) - Blum, Floyd et al. - 1973
109 Provably good mesh generation - Bern, Eppstein et al. - 1994
106 A decomposition of multi-dimensional point-sets with applica.. - Callahan, Kosaraju - 1992
94 Closest point problems (context) - Shamos, Hoey - 1975
74 On constructing minimum spanning trees in k-dimensional spac.. (context) - Yao - 1982
67 An unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
43 Iterated nearest neighbors and finding minimal polytopes - Eppstein, Erickson - 1993
30 Selecting distances in the plane (context) - Agarwal, Aronov et al. - 1990
23 Ambivalent data structures for dynamic 2-edge-connectivity a.. (context) - Frederickson - 1991
22 Simple algorithms for enumerating interpoint distances and f.. (context) - Dickerson, Drysdale et al. - 1992
13 Maintaining the minimal distance of a point set in polylogar.. (context) - Smid - 1991
13 Maintaining the minimal distance of a point set in less than.. (context) - Smid - 1991
11 An optimal algorithm for selection in a min-heap (context) - Frederickson - 1993
11 Optimal parallel all-nearest-neighbors using the well-separa.. - Callahan - 1993
10 On nearest-neighbor graphs (context) - Paterson, Yao - 1992
5 The Complexity of finding fixed-radius near neighbors (context) - Bentley, Stanat et al. - 1977
4 On k-nearest neighbor Voronoi diagrams in the plane (context) - Lee - 1982
3 An O(n log n) algorithm for the all-nearest-neighbors proble.. (context) - Vaidya - 1989
3 Fixed radius search problem for points and segments (context) - Dickerson, Drysdale - 1990
3 Shallow interdistance selection and interdistance enumeratio.. (context) - Salowe - 1991
2 New techniques for computing order statistics in Euclidean s.. (context) - Chazelle - 1985
2 Enumerating k distances for n points in the plane (context) - Dickerson, Drysdale - 1991
2 Enumerating distances in space (context) - Salowe - 1992
2 Enumerating the k closest pairs optimally (context) - Lenhof, Smid - 1992
1 Fast Algorithms for the Greedy Triangulation (context) - Dickerson, Drysdale et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC