Algorithms: Distribution Sweep vs. Plane Sweep Yi-Jen Chiang (April 1995;...  Home/Search
Context
Related
| poly.edu/chiang/intersectexp.ps.gz 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: poly.edu/chiang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation are our implementations of distribution sweep and three variations of plane sweep. Distribution... (Update)
Similar documents (at the sentence level):
33.8%: Experiments on the Practical I/O Efficiency of Geometric.. - Chiang (1995) (Correct)
29.3%: Dynamic and I/O-Efficient Algorithms for Computational Geometry.. - Chiang (1995) (Correct)
Active bibliography (related documents): More All
0.6: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
0.5: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.5: Unknown - External-Memory Graph Algorithms (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ sweep-experiments,
author = "Algorithms Distribution Sweep",
title = "Experiments on the Practical I/O Efficiency of Geometric",
url = "citeseer.ist.psu.edu/762334.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
334 Operating System Concepts (context) - Silberschatz, Peterson et al. - 1991
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995
104 Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1994
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993
78 Fast algorithms for geometric traveling salesman problems (context) - Bentley - 1992
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
50 External-memory algorithms for processing line segments in g.. - Arge, Vengroff et al. - 1995
49 Virtual Memory for Data Parallel Computing (context) - Cormen - 1992
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
41 Blocking for external graph searching - Goodrich, Nodine et al. - 1993
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Sundquist et al. - 1994
33 trees for semidynamic point sets (context) - Bentley - 1990
33 Fast permuting in disk arrays (context) - Cormen - 1993
31 Organization of large ordered indexes (context) - Bayer, McCreight - 1972
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1995
30 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
26 A data structure for dynamically maintaining rooted trees (context) - Frederickson - 1993
24 Experiments on traveling salesman heuristics (context) - Bentley - 1990
24 complexity of ordered binary-decision diagram manipulation (context) - Arge, O- - 1995
20 OODB indexing by class-division - Ramaswamy, Kanellakis - 1995
18 Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
16 trees and their applications (context) - Callahan, Goodrich et al. - 1995
16 Memory paging for connectivity and path problems in graphs - Feuerstein, Marchetti-Spaccamela - 1993
15 ACM Comput (context) - Comer, B-tree - 1979
14 A general lower bound on the I/O-complexity of comparison-ba.. - Arge, Knudsen et al. - 1993
13 Further computational geometry in secondary memory (context) - Zhu - 1994
9 Annals of Mathematics and Artificial Intelligence (context) - Ullman, Yannakakis et al. - 1991
9 sets representation and fast halfplane searching (context) - Franciosa, Talamo et al. - 1994
8 A transparent parallel I/O environment (context) - Vengroff - 1994
6 Tools for experiments on algorithms (context) - Bentley - 1990
3 Personal communication (context) - Galvin - 1995
2 Personal communication (context) - Doeppner - 1995
1 The maximum size of dynamic data structures (context) - Kenyon-Mathieu, Vitter - 1991
Documents on the same site (http://cis.poly.edu/chiang/): More
I/O Optimal Isosurface Extraction (Extended Abstract) - Chiang, Silva (Correct)
On the Maximum Scatter TSP (Extended Abstract) - Arkin, Chiang, Mitchell.. (1997) (Correct)
Optimal Shortest Path and Minimum-Link Path Queries Between.. - Chiang, Tamassia (1994) (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