D.S. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, C. Zhu  Home/Search
Context Related
| cs.ubc.ca/spider/snoeyi...overlay.ps.gz unc.edu/~snoeyink/paper...overlay.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: cs.ubc.ca/spider/snoeyin...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The usual first step in computing an overlay of two vector maps is to determine which pairs of segments (one from each map) intersect so as to perform line-breaking. We identify two classes of algorithms for the segment intersection problem, spatial partitioning and spatial ordering, and we report on implementations of seven algorithms, some known and some new. Though the spatial ordering algorithms can be made output sensitive, our experiments show that the spatial partitioning algorithms are... (Update)
Context of citations to this paper: More
.... special interest because it is an abstraction of the important map overlay problem, which is the core of several vector based GISs [2, 3, 22]. Our red blue line segment intersection algorithm is optimal because the external memory lower bound technique of [5] can be applied to...
.... is of special interest because it is an abstraction of the important map overlay problem, which is the core of several vector based GISs [2, 3, 22]. Our red blue line segment intersection algorithm is optimal because the external memory lower bound technique of [5] can be...
Cited by: More
Optimal Binary Space Partitions for Orthogonal Objects - Hai (Correct)
Efficient Algorithms for Line and Curve Segment.. - Boissonnat, Snoeyink (1999) (Correct)
External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
Active bibliography (related documents): More All
1.3: Applications of Computational Geometry to Geographic.. - De Floriani, Puppo.. (Correct)
0.4: A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment.. - Chan (1994) (Correct)
0.3: Counting and Reporting Red/Blue Segment Intersections - Palazzi, Snoeyink (1993) (Correct)
Similar documents based on text: More All
0.7: Intersecting Red and Blue Line Segments in . . . - Mantler (2001) (Correct)
0.3: Visibility Queries among Horizontal Segments --- - Dynamic Data Structure (2000) (Correct)
0.2: Line Segment Intersection - Today Am Going (Correct)
Related documents from co-citation: More All
12: An optimal algorithm for intersecting line segments in the plane (context) - Chazelle, Edelsbrunner - 1992
10: A simple trapezoid sweep algorithm for reporting red/blue segment intersections - Chan - 1994
9: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
BibTeX entry: (Update)
D. S. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, and C. Zhu. Further comparisons of algorithms for geometric intersection problems. In Proc. 6th Int'l. Symp. on Spatial Data Handling, 1994. http://citeseer.ist.psu.edu/andrews94further.html More
@misc{ andrews94further,
author = "D. Andrews and J. Snoeyink and J. Boritz and T. Chan and G. Denham and
J. Harrison and C. Zhu",
title = "Further comparisons of algorithms for geometric intersection problems",
text = "D. S. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison,
and C. Zhu. Further comparisons of algorithms for geometric intersection
problems. In Proc. 6th Int'l. Symp. on Spatial Data Handling, 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/andrews94further.html" }
Citations (may not include all citations):1254 Computational Geometry---An Introduction (context) - Preparata, Shamos - 1985
666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
210 On visible surface generation by a priori tree structures (context) - Fuchs, Kedem et al. - 1980
169 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann - 1979
114 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1992
105 Set operations on polyhedra using binary space partitioning .. (context) - Thibault, Naylor - 1987
60 Algorithms for bichromatic line segment problems and polyhed.. (context) - Chazelle, Edelsbrunner et al. - 1990
19 A simple trapezoid sweep algorithm for reporting red/blue se.. - Chan - 1994
18 QUILT: a geographic information system based on quadtrees (context) - Shaffer, Samet et al. - 1990
16 Counting and reporting red/blue segment intersections - Palazzi, Snoeyink - 1994
6 Uniform grids: A technique for intersection detection on ser.. (context) - Franklin, Narayanaswami et al. - 1989
4 Comparative study of algorithms for reporting geometrical in.. (context) - Pullar - 1990
4 Lessons for the design of polygon overlay processing from th.. (context) - Chrisman, Dougenik et al. - 1992
4 A modified binary space partition for geographic information.. (context) - van Oosterom - 1990
3 Reporting line segment intersections (context) - Mairson, Stolfi - 1988
2 Efficient intersection calculations in large databases (context) - Franklin - 1989
2 Geometric computing and the uniform grid data technique (context) - Franklin, Kankanhalli et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ubc.ca/spider/snoeyink/papers/papers.html): More
Folding Rulers inside Triangles - van Kreveld, Snoeyink, Whitesides (1996) (Correct)
Efficiently Planning Compliant Motion In The Plane - Friedman, Hershberger, SNOEYINK (1996) (Correct)
Cartographic Line Simplification and Polygon CSG Formulae.. - Hershberger, Snoeyink (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