Yi-Jen Chiang  Home/Search
Context
Related
Links: ACM DBLP | brown.edu/pub/techreport...cs9507.ps.Z 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: indiana.edu/pub/ucstri/index (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 distribution sweep and three variations of plane sweep. Distribution sweep is specifically... (Update)
Similar documents (at the sentence level):
61.6%: Experiments on the Practical I/O Efficiency of Geometric.. - Chiang (1997) (Correct)
47.0%: Experiments on the Practical I/O Efficiency of Geometric - Algorithms Distribution Sweep (Correct)
Active bibliography (related documents): More All
1.4: Dynamic and I/O-Efficient Algorithms for Computational Geometry.. - Chiang (1995) (Correct)
0.7: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
0.6: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.3: External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
BibTeX entry: (Update)
@article{ chiang98experiments,
author = "Yi-Jen Chiang",
title = "Experiments on the practical {I}/{O} efficiency of geometric algorithms: Distribution sweep versus plane sweep",
journal = "Computational Geometry. Theory and Applications",
volume = "9",
number = "4",
pages = "211--236",
year = "1998",
url = "citeseer.ist.psu.edu/chiang95experiments.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
1254 Computational Geometry: an Introduction (context) - Preparata, Shamos - 1985
121 External-memory computational 15 geometry - Goodrich, Tsay et al. - 1993
113 output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
104 Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1994 ACM DBLP
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993 ACM DBLP
78 Fast algorithms for geometric traveling salesman problems (context) - Bentley - 1992
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993 ACM DBLP
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994 ACM DBLP
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 ACM
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 ACM DBLP
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Sundquist et al. - 1994 ACM DBLP
33 trees for semidynamic point sets (context) - Bentley - 1990
33 Fast permuting in disk arrays (context) - Cormen - 1993
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1995
31 Organization of large ordered indexes (context) - Bayer, McCreight - 1972
26 A data structure for dynamically maintaining rooted trees (context) - Frederickson - 1993 ACM DBLP
24 Experiments on traveling salesman heuristics (context) - Bentley - 1990 ACM DBLP
18 Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
18 A transparent parallel I/O environment (context) - Vengroff - 1994
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 ACM DBLP
15 ACM Comput (context) - Comer, B-tree - 1979
15 Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis et al. - 1991
13 Further computational geometry in secondary memory (context) - Zhu - 1994 ACM DBLP
9 sets representation and fast halfplane searching (context) - Franciosa, Talamo et al. - 1994
6 Tools for experiments on algorithms (context) - Bentley - 1990
3 The maximum size of dynamic data structures (context) - Kenyon-Mathieu, Vitter - 1991 ACM DBLP
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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