Efficient Parallel Algorithms for Closest Point Problems

Alternate document: Details An Efficient Thermal Infrared Radiation Parameterization For Use In General Circulation Models (94) Ming-Dah Chou Max J. Suarez

See this document in CiteSeerX!

Efficient Parallel Algorithms for Closest Point Problems (1994) (Make Corrections) (8 citations)
Peter Su

Home/Search Context Related

View or download:
duke.edu/pub/dist/techre...199422.ps.Z
berkeley.edu/~jrs/mesh...SuThesis.ps.gz
Cached: PS.gz PS PDF Image Update Help

From: duke.edu (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: OF THE THESIS This dissertation develops and studies fast algorithms for solving closest point problems. Algorithms for such problems have applications in many areas including statistical classification, crystallography, data compression, and finite element analysis. In addition to a comprehensive empirical study of known sequential methods, I introduce new parallel algorithms for these problems that are both efficient and practical. I present a simple and flexible programmingmodel for... (Update)

Context of citations to this paper: More

...algorithms based upon divide andconquer and sweepline techniques, which will be discussed here only briefly. Refer to Su and Drysdale [68, 67] for an overview of these and other two dimensional Delaunay triangulation algorithms. Incremental insertion algorithms operate by...

...experiments. One drawback is that many implemented parallel algorithms are tuned to work most efficiently for the uniform distributions [37, 35] but fail to be efficient for nonuniform distributions. Here we define new point distributions for which we can find efficient...

Cited by: More
Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997) (Correct)
Design and Implementation of a Practical Parallel.. - Blelloch, Hardwick, .. (1999) (Correct)
A Comparison of Sequential Delaunay Triangulation Algorithms - Su, Drysdale (1996) (Correct)

Active bibliography (related documents): More All
1.3: Developing a Practical Projection-Based Parallel Delaunay.. - Blelloch, Miller, Talmor (1996) (Correct)
0.8: Voronoi Diagrams and Delaunay Triangulations - Fortune (1992) (Correct)
0.6: Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes - Heywood, Leopold (1995) (Correct)

Similar documents based on text: More All
0.2: A Dynamic Separator Algorithm - Deganit Armon John (1993) (Correct)
0.2: Computer Science - Computer Science Computer (2001) (Correct)
0.2: A Simple Linear Time Greedy Triangulation Algorithm for.. - Drysdale, Rote, al. (1995) (Correct)

Related documents from co-citation: More All
6: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
6: A data-parallel algorithm for three-dimensional Delaunay triangulation and its i.. (context) - Teng, Sullivan et al. - 1993
6: A comparison of sequential delaunay triangulation algorithms - Su, Drysdale - 1995

BibTeX entry: (Update)

Peter Su. Efficient parallel algorithms for closest point problems. PhD thesis, Dartmouth College, 1994. PCS-TR94-238. http://citeseer.ist.psu.edu/su94efficient.html More

@techreport{ susuefficient,
    author = "Peter Su.",
    title = "Efficient Parallel Algorithms for Closest Point Problems",
    publisher = "Department of Computer Science, Duke University",
    url = "citeseer.ist.psu.edu/su94efficient.html" }

Citations (may not include all citations):
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
1209 Concurrency Control and Recovery in Database Systems (context) - Bernstein, Hadzilacos et al. - 1987
735 A bridging model for parallel computation (context) - Valiant - 1990
531 Logp: Towards a realistic model of parallel computation - Culler, Karp et al. - 1992
394 Solving Problems on Concurrent Processors (context) - Fox, Johnson et al. - 1988
345 Basic linear algebra subprograms for fortran usage (context) - Lawson, Hanson et al. - 1979
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
268 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
245 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
239 Algorithms for scalable synchronization on shared memory mul.. (context) - Mellor-Crummey, Scott - 1991
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
200 Data parallel algorithms (context) - Steele, Hillis - 1986
182 A comparison of sorting algorithms for the connection machin.. - Blelloch, Leiserson et al. - 1991
166 Nesl: A nested data-parallel language - Blelloch - 1993
159 A sweepline algorithm for voronoi diagrams (context) - Fortune - 1987
159 Spatial Tessellations: Concepts and Applications of Voronoi .. (context) - Okabe, Boots et al. - 1992
142 Guided self-scheduling: A practical scheduling scheme for pa.. (context) - Polychronopoulos, Kuck - 1987
109 Multi-dimensional divide-and-conquer (context) - Bentley - 1980
107 The dash prototype: Implementation and performance (context) - Lenoski, Laudon et al. - 1992
104 Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1992
101 Randomized incremental construction of delaunay and voronoi .. (context) - Guibas, Knuth et al. - 1992
99 Information Processing Letters (context) - Hagerup, Rub et al. - 1989
94 Closest-point problems (context) - Shamos, Hoey - 1975
90 Compiler support for machineindependent parallel programming.. - Hiranandani, Kennedy et al. - 1991
89 Optimizing Supercompilers for Supercomputers (context) - Wolfe - 1989
89 Supporting shared data structures on distributed memory arch.. (context) - Koelbel, Mehrotra et al. - 1990
87 The implementation of a coherent memory abstraction on a num.. (context) - Cox, Fowler - 1989
85 The apram: Incorporating asynchrony into the pram model (context) - Cole, Zajicek - 1989
81 A linear time algorithm for computing the voronoi diagram of.. (context) - Aggarwal, Guibas et al. - 1989
79 Communication complexity of prams (context) - Aggarwal, Chandra et al. - 1990
76 The wisconsin multicube: A new large-scale cachecoherent mul.. (context) - Goodman, Woest - 1988
74 Transactional memory: Architectural support for lock free da.. - Herlihy, Moss - 1992
70 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
69 Optimal expected time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
67 Verifiable implementations of geometric algorithms using fin.. (context) - Milenkovic - 1988
64 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1982
62 Parallel computational geometry (context) - Aggarwal, Chazelle et al. - 1988
57 Two algorithms for constructing a delaunay triangulation (context) - Lee, Schachter - 1980
56 A geometric consistency theorem for a symbolic pertubation s.. (context) - Yap - 1990
51 Four results on randomized incremental construction - Clarkson, Mehlhorn et al. - 1992
49 Virtual Memory for Data-Parallel Computing (context) - Cormen - 1992
48 Cascading divide and conquer: A technique for designing para.. (context) - Attallah, Cole et al. - 1989
48 Evaluating the performance of four snooping cache-coherency .. (context) - Eggers, Katz - 1989
41 Integral Geometry and Geometric Probability (context) - Santalo - 1976
40 Computing dirichlet tessellations in the plane (context) - Green, Sibson - 1977
38 Higher-dimensional voronoi diagrams in linear expected time (context) - Dwyer - 1991
36 Stable maintenance of point-set triangulations in two dimens.. (context) - Fortune - 1989
35 Hiding shared memory reference latency on the galactica-net .. (context) - Wilson, LaRowe - 1992
34 Implementations of randomized sorting on large parallel mach.. - Prins, Hightower et al. - 1992
31 Communication efficient parallel algorithms for distributed .. - Leiserson, Maggs - 1988
26 Radix sort for vector multiprocessors - Zagha, Blelloch - 1991
24 A faster divide-and-conquer algorithm for constructing delau.. (context) - Dwyer - 1987
24 Ultra-fast expected time parallel algorithms - MacKenzie, Stout - 1990
23 Writing Efficient Programs (context) - Bentley - 1982
20 Fully dynamic delaunay triangulation in logarithmic expected.. - Devillers, Meider et al. - 1990
16 time algorithm for the threedimensional convex hull problem (context) - Edelsbrunner, Shi et al. - 1991
15 The expected extremes in a delaunay triangulation - Bern, Eppstein et al. - 1991
15 Compiling Data-parallel Programs for Efficient Execution on .. (context) - Chatterjee - 1991
15 Scan primitives for vector computers - Chatterjee, Blelloch et al. - 1990
15 Beyond core: Making parallel computer I/O practical - Womble, Greenberg et al. - 1993
14 A new algorithm for three dimensionalvoronoi tessellation (context) - Tanemura, Ogawa et al. - 1983
12 Merging free trees in parallel for efficient voronoi diagram.. (context) - Cole, Goodrich et al. - 1990
12 Polling: A new randomized sampling technique for computation.. (context) - Reif, Sen - 1989
11 Logarithmic time cost optimal parallel sorting is not yet fa.. - Natvig - 1990
11 Parallel geometric algorithms on a mesh connected computer (context) - Jeong, Lee - 1990
11 programs for a hypercube multicomputer (context) - Quinn, Hatcher et al. - 1988
11 Experimental Analysis of Algorithms (context) - McGeoch - 1986
10 A data-parallel algorithm for threedimensional delaunay tria.. (context) - Teng, Sullivan et al. - 1993
10 Delaunay triangulation and the convex hull of n points in ex.. (context) - Maus - 1984
8 Size and access inference for data parallel programs - Chatterjee, Blelloch et al. - 1991
7 Parallel implementation of an algorithm for delaunay triangu.. (context) - Merriam - 1992
7 Applied computational geometry: Towards robust solutions of .. (context) - Dobkin, Silver - 1990
6 Tools for experiments on algorithms (context) - Bentley - 1991
5 Improvements of the incremental method for the voronoi diagr.. (context) - Ohya, Iri et al. - 1984
5 Constructing delaunay triangulations by merging buckets in q.. (context) - Katajainen, Koppinen - 1987
5 Computational geometry with imprecise data and arithmetic (context) - Barber - 1993
5 Numerical stability of algorithms for delaunay triangulation.. (context) - Fortune - 1992
4 An optimal expected-time parallel algorithm for voronoi diag.. (context) - Levcopoulos, Katajainen et al. - 1988
4 Constructing the voronoi diagram on a mesh connected compute.. (context) - Lu - 1986
4 Average-case Analysis of Algorithms for Convex Hulls and Vor.. (context) - Dwyer - 1988
3 The directory-based cachecoherency protocol for the dash mul.. (context) - Lenoski, Laudon et al. - 1990
3 A practical hierachical model of parallel computation: The m.. (context) - Heywood, Ranka - 1991
3 Greed sort: An optimal external sorting algorithm for multip.. (context) - Nodine, Vitter - 1991
3 An efficient expected time parallel algorithm for voronoi co.. (context) - Venmuri, Varadarajan et al. - 1992
2 ACM Symposium On Theory Of Computing (context) - Alpern, Carter et al. - 1990
2 Parallel Algorithms for Computational Geometry (context) - Chow - 1980
2 Voronoi diagrams-a survey of a fundemantal geometric data st.. (context) - Aurenhammer - 1991
2 th Annual ACM Symposium on Computational Geometry (context) - Bentley, for et al. - 1990
2 Computational geometry on a hypercube (context) - Stojmenovic - 1986
2 Randomized incremental construction of delaunay diagrams: Th.. (context) - Sharir, Yaniv - 1991
1 Compilig parallel programs by optimizing performance (context) - Chen, Choo et al. - 1988
1 Prototyping parallel and distributed algorithms in proteus (context) - Mills, Nyland et al. - 1991
1 Efficient syncrhonization primitives for large-scale cache-c.. (context) - Goodman, Vernon et al. - 1989
1 Optimal parallel randomized algorithms for 3-d convex hulls .. - Reif, Sen - 1992
1 Computing digitized voronoi diagrams on a systolic screen an.. (context) - Dehne - 1989
1 The Cyberiad: Fables for the Cybernetic Age (context) - Lem - 1985
1 The dino parallel progamming language (context) - Rosing, Schnabel et al. - 1990
1 Statistical Methods for the Analysis of Algorithms (context) - Weide - 1978
1 Algorithms for Closest Point Problems (context) - Clarkson - 1984
1 Scans as primitive parallel operators (context) - Blelloch - 1989
1 Limitless directories: A scalable cache coherence scheme (context) - Aggarwal, Jubiatowicz et al. - 1991
1 Efficient comvexity and domination algorithms for fine- and .. (context) - Cohen, Miller et al. - 1992
1 ACM-SIAM Symposium on Discrete Algorithms (context) - Bentley, travel - 1989
1 Annual ACM Symposium on Parallel Algorithms and Architecture.. (context) - Gibbons, practical et al. - 1989
1 Annual ACM Symposium on Parallel Algorithms and Architecture.. (context) - Aggarwal, Chandra et al. - 1989

The graph only includes citing articles where the year of publication is known.

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994) (Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994) (Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (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