Abstract
The uniform grid data structure is a flat (non-hierarchical) grid whose resolution adapts to the data. An exhaustive analysis of the uniform grid data structure for determining intersections in a set of many small line segments is presented. Databases from cartography, VLSI, and graphics with up to 115,973 edges are used. For each data set the intersection time, the ratio of edge pairs tested to pairs found to intersect, and size of intermediate data structures was measured as a function of grid resolution. The execution time was relatively insensitive to the grid size over a range of up to a factor of 10. 115,973 edges were processed to find 135,050 intersections in 683 seconds on a Sun 3/50 workstation. This data structure is also ideally suited for implementation on a parallel machine. When executing on a 16 processor Sequent Balance 21000, total times averaged ten times faster than when using only one processor. Finding all 81,373 intersections in a 62,045 edge database took only 28 seconds elapsed time. This research shows that more complicated, hierarchical data structures, such as quadtrees, are not necessary for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sequent Computer Systems Inc., Balance Technical Summary, 1986.
J.L. Bentley and D. Wood, “An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles,”IEEE Trans. Comput., vol. C-29, no. 7, pp. 571–576, July 1980.
K.Q. Brown, “Comments on ‘Algorithms for Reporting and Counting Geometric Intersections‘,” IEEE Trans. Comput, vol. C-30, no. 2, pp. 147–148, February 1981.
Narayanaswami Chandrasekhar and Manoj Seshan, “The Efficiency of the Uniform Grid for Computing Intersections,” M.S. thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, December 1987.
B.M. Chazelle, Reporting and Counting Arbitrary Planar Intersections, CS-83–16, Dept. of Computer Science, Brown University, Providence, RI, 1983.
C.M. Eastman and C.I. Yessios, An Efficient Algorithm for Finding the Union, Intersection, and, Sept. 1972. Carnegie-Mellon University, Dept. of Computer Science
W. Randolph Franklin,Combinatorics of Hidden Surface Algorithms, Center for Research in Computing Technology, Harvard University, June 1978. Ph.D. thesis
Wm. Randolph Franklin, “A Linear Time Exact Hidden Surface Algorithm,” ACM Computer Graphics, vol. 14, no. 3, pp. 117–123, July 1980. Proceedings of SIGGRAPH’80
Wm. Randolph Franklin, “An Exact Hidden Sphere Algorithm That Operates In Linear Time,” Computer Graphics and Image Processing, vol. 15, no. 4, pp. 364–379, April 1981.
Wm. Randolph Franklin, “Efficient Polyhedron Intersection and Union,” Proc. Graphics Interfaced, pp. 73–80, Toronto, 19–21 May 1982.
Wm. Randolph Franklin, “A Simplified Map Overlay Algorithm,” Harvard Computer Graphics Conference, Cambridge, MA, 31 July - 4 August 1983. sponsored by the Lab for Computer Graphics and Spatial Analysis, Graduate School of Design, Harvard University.
Wm. Randolph Franklin, “Adaptive Grids For Geometric Operations,” Proc. Sixth International Symposium on Automated Cartography (Auto-Carto Six), vol. 2, pp. 230–239, Ottawa, Canada, 16–21 October 1983.
Wm. Randolph Franklin and Varol Akman, A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination, Univ. of Utrecht, CS Dept., Utrecht, October 1985. report number RUU-CS-85–28
Wm. Randolph Franklin and Peter Y.F. Wu, A Polygon Overlay System in Prolog, Autocarto 8 Conference, Baltimore, March-April 1987.
Marta Kallstrom and Shreekant Thakkar, “Programming three Parallel Computers,” IEEE Software, vol. 5, no. 1, pp. 11–22, January 1988.
Mohan Kankanhalli, “Uniform Grids for Lines Intersection in Parallel,”M.S. Thesis, Electrical,Computer & Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, NY, February 1988.
J.Z. Levin, “Mathematical Models For Determining the Intersections of Quadric Surfaces,” Computer Graphics and Image Processing, vol. 11, pp. 73–87, 1979.
K. Maruyama, “A Procedure to Determine Intersections Between Polyhedral Objects,” Int. J. Comput. Infor. Sc., vol. 1, no. 3, pp. 255–266, 1972.
J. Nievergelt and F.P. Preparata, “Plane-Sweep Algorithms for Intersecting Geometric Figures,” Comm. ACM, vol. 25, no. 10, pp. 739–747, October 1982.
Thomas Ottmann, Peter Widmayer, and Derick Wood, “A Fast Algorithm for the Boolean Masking Problem,” Computer Vision, Graphics, and Image Processing, vol. 30, pp. 249–268, Academic Press, 1985.
H. Samet, “The Quadtree and Related Hierarchical Data Structures,” ACM Computing Surveys, vol. 16, no. 2, pp. 187–260, June 1984.
H.-W. Six and D. Wood, “The Rectangle Intersection Problem Revisited,” BIT, vol. 20, pp. 426–433, 1980.
R.B. Tilove, “Set Membership Classification: A Unified Approach to Geometric Intersection Problems,” IEEE Trans. Comput., vol. C-29, no. 10, pp. 874–883, October 1980.
T.C. Waugh, “A Response to Recent Papers and Articles on the Use of Quadtrees for Geographic Information Systems,” Proceedings of the Second International Symposium on Geographic Information Systems, pp. 33–37, Seattle, Wash. USA, 5–10 July 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, W.R., Chandrasekhar, N., Kankanhalli, M., Seshan, M., Akman, V. (1988). Efficiency of Uniform Grids for Intersection Detection on Serial and Parallel Machines. In: Magnenat-Thalmann, N., Thalmann, D. (eds) New Trends in Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83492-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-83492-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83494-3
Online ISBN: 978-3-642-83492-9
eBook Packages: Springer Book Archive