Skip to main content
SpringerLink
Log in

Computational geometry on a grid an overview

  • Conference paper
Theoretical Foundations of Computer Graphics and CAD

Part of the book series: NATO ASI Series ((NATO ASI F,volume 40))

Abstract

In this paper an overview is given of a number of algorithms solving problems in computational geometry on a grid, i.e., in the case where objects have integer coordinates in some bounded universe. The emphasis is on simple, yet efficient solutions. Especially problems with some relevance to computer graphics are studied.

Simple and efficient algorithms are given for sorting of multi-dimensional pointsets, searching in such sets, finding a convex hull or maximal elements, finding intersections between rectangles (bounding boxes) and line segments (an important step in hidden line removal), etc.

The techniques show that in the restricted environment that often occurs in computer graphics (and other) applications, there is in general no need for the complicated or less efficient methods that solve the problems in general space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrew, A.M., Another efficient algorithm for convex hulls in two dimensions, Info Proc. Lett. 8 (1979), 108–109.

    Article  Google Scholar 

  2. Chazelle, B., Intersecting is easier than sorting, Proc. 16th Annual ACM Symp. on Theory of Computing ,1984, 125–134.

    Google Scholar 

  3. Bentley, J.L. and T.A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. on Computers 28 (1979), 643–647.

    Article  MATH  Google Scholar 

  4. Fredman, M.L., J. Komlos and E. Szemeredi, Storing a sparse table with O(1) worst case access time, J. ACM 31 (1984), 538–544.

    Article  MATH  MathSciNet  Google Scholar 

  5. Gabow,H.N., J.L. Bentley and R.E. Tarjan, Scaling and related techniques for geometric problems, Proc. 16th Annual ACM Symposium on Theory of Computing ,1984, 135–143.

    Google Scholar 

  6. Graham, R.L., An efficient algorithm for determining the convex hull of a finite planar set, Info. Proc. Lett. 1 (1972), 132–133.

    Article  MATH  Google Scholar 

  7. Johnson, D.B., A priority queue in which initialization and queue operations take O(loglog D) time, Math. Systems Theory 15 (1982), 295–310.

    Article  MATH  Google Scholar 

  8. Karlsson, R.G., Algorithms in a restricted universe ,Ph.D. thesis, Techn. Rep. CS-84–50, Dept. of Comp. Science, University of Waterloo, 1984.

    Google Scholar 

  9. Karlsson, R.G., and J.I. Munro, Proximity on a grid, Proc. 2nd Symp. on Theoretical Aspects of Comp. Science ,Springer-Verlag Lect. Notes in Comp. Science 182, 1985, 187–196.

    Google Scholar 

  10. Karlsson, R.G., and M.H. Overmars, Scanline algorithms on a grid ,Techn. Rep. RUU-CS-86–18, Dept. of Comp. Science, University of Utrecht, 1986.

    Google Scholar 

  11. Karlsson, R.G., and M.H. Overmars, Normalised divide and conquer: A scaling technique for solving multi-dimensional problems ,Techn. Rep. RUU-CS-86–19, Dept. of Comp. Science, University of Utrecht, 1986.

    Google Scholar 

  12. Keil, J.M., and D.G. Kirkpatrick, Computational geometry on integer grid, Proc. 19th Annual Allerton Conference ,1981, 41–50.

    Google Scholar 

  13. Kirkpatrick, D.G., and S. Reisch, Upperbounds for sorting integers on random access machines, Theoretical Computer Science 28 (1984), 263–276.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kirkpatrick, D.G., and R. Seidel, The ultimate convex hull algorithm? ,Techn. Rep. 83–577, Dept of Comp. Science, Cornell University, 1983.

    Google Scholar 

  15. Kung, H.T., F. Luccio and F.P. Preparata, On finding the maxima of a set of vectors, J. A CM 22 (1975), 469–476.

    MATH  MathSciNet  Google Scholar 

  16. Müller, H., Rastered point location, Proc. Workshop on Graphtheoretic Concepts in Computer Science (WG85) ,Trauner Verlag, 1985, 281–293.

    Google Scholar 

  17. Myers, F.W., An O(E log E + I) expected time algorithm for the planar segment intersection problem, SIAM J. Computing 14 (1985), 625–637.

    Article  MATH  Google Scholar 

  18. Overmars, M.H., Range searching on a grid, Proc. Workshop on Graphtheoretic Concepts in Computer Science (WG85) ,Trauner Verlag, 1985, 295–305.

    Google Scholar 

  19. Overmars, M.H. Efficient data structures for range searching on a grid ,Techn. Rep. RUU-CS-87–2, Dept. of Comp. Science, University of Utrecht, 1987.

    Google Scholar 

  20. Preparata, F.P., and S.J. Hong, Convex hulls of finite sets of points in two and three dimensions, Comm. ACM2 (1977), 87–93.

    Google Scholar 

  21. Preparata, F.P., and M.I. Shamos, Computational geometry, An introduction ,Springer-Verlag, New York, 1985.

    Google Scholar 

  22. Schmitt, A., Time and space bounds for hidden line and hidden surface algorithms, Proc Eurographics 1981 ,North Holland Publ. Co., 1981, 43–56.

    Google Scholar 

  23. van Emde Boas, P., Preserving order in a forest in less than logarithmic time and linear space, Info. Proc. Lett. 6 (1977), 80–82.

    Article  MATH  Google Scholar 

  24. van Emde Boas, P., R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), 99–127.

    Article  MATH  Google Scholar 

  25. Willard, D.E., Log-logarithmic worst-case range queries are possible in space (n), Info. Proc. Lett. 17 (1983), 81–84.

    Article  MATH  MathSciNet  Google Scholar 

  26. Willard, D.E., New trie data structures which support very fast search operations, J. Comput Syst. Sci. 28 (1984), 379–394.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. Mark H. Overmars
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Leeds, UK

    Rae A. Earnshaw

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Overmars, M.H. (1988). Computational geometry on a grid an overview. In: Earnshaw, R.A. (eds) Theoretical Foundations of Computer Graphics and CAD. NATO ASI Series, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83539-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83539-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83541-4

  • Online ISBN: 978-3-642-83539-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation