Advertisement

Translating polygons with applications to hidden surface removal

  • Mark de Berg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 447)

Abstract

Let S be a set of polygons in the plane with a total number of n vertices. A translation ordering for S (in direction d) is an ordering of the polygons such that, if the polygons are moved one by one to infinity in direction d according to this ordering, no collisions occur between the polygons. We show that, after O(n log n) preprocessing using O(n) space, it is possible to determine, for any given d, in O(log n) time whether such an ordering exists and, if so, to compute an ordering in O(n) time.

Translation orderings correspond to valid orderings for hidden surface removal schemes where objects that are closer to the viewpoint are displayed later than objects that are farther away. Thus our technique can be used to generate displaying orderings for polyhedral terrains. One of the main advantages of our approach is that it can easily be adapted to handle perspective views within the same time and space bounds.

Keywords

Computational geometry separation problems hidden surface removal relative convex hulls 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Chazelle, B., A Theorem on Polygon Cutting with Applications, Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science, 1982, pp. 339–349.Google Scholar
  2. [2]
    Dehne, F., and J.-R. Sack, Separability of Sets of Polygons, Proc. 12th International Workshop on Graph-Theoretic Concepts in Computer Science, 1986, pp. 237–251.Google Scholar
  3. [3]
    Egyed, P., Hidden Surface Removal in Polyhedral-Cross-Sections, The Visual Computer 3 (1988), pp. 329–343.CrossRefGoogle Scholar
  4. [4]
    El Gindy, H.A., and G.T. Toussaint, Efficient Algorithms for Inserting and Deleting Edges from Triangulations, Proc. International Conf. on Foundations of Data Organization, 1985.Google Scholar
  5. [5]
    Guibas, L.J., and F.F. Yao, On Translating a Set of Rectangles, in: F. P. Preparata (Ed.), Advances in Computing Research Vol. I: Computational Geometry, JAI Press Inc., 1983, pp. 61–77.Google Scholar
  6. [6]
    Kahn, J., M. Klawe and D. Kleitman, Traditional Galleries Require Fewer Watchmen, SIAM J. Alg. Disc. Meth. 14 (1983), pp. 194–206.Google Scholar
  7. [7]
    Knuth, D.E., Fundamental Algorithms: The Art of Computer Programming I, Addison-Wesley, Reading, Mass., 1968.Google Scholar
  8. [8]
    Lee, D.T., and F.P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks 14 (1984), pp. 393–410.Google Scholar
  9. [9]
    Nurmi, O., On Translating a Set of Objects in Two-and Three-dimensional Space, Computer Vision, Graphics and Image Processing 36 (1986), pp. 42–52.Google Scholar
  10. [10]
    Nussbaum, D., and J.-R. Sack, Translation Separability of Polyhedra, manuscript, presented at the 1st Canadian Conf. on Computational Geometry.Google Scholar
  11. [11]
    Nussbaum, D., and J.-R. Sack, Disassembling Two-dimensional Composite Parts Via Translations, Proc. Int. Conf. on Optimal Algorithms, 1989.Google Scholar
  12. [12]
    Paterson, M.S., and F.F. Yao, Binary Partitions with Applications to Hidden-Surface Removal and Solid Modelling, Proc. 5th Annual ACM Symp. on Computational Geometry, 1989, pp. 23–32.Google Scholar
  13. [13]
    Preparata, F.P., and M.I. Shamos, Computational geometry, an introduction, Springer-Verlag, New York, 1985.Google Scholar
  14. [14]
    Preparata, F.P., and K.J. Supowit, Testing a Simple Polygon for Monotonicity, Inform. Proc. Letters 12 (1981), pp.161–164.Google Scholar
  15. [15]
    Reif, J.H., and S. Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and its Parallelization, Proc. 4th Annual ACM Symp. on Computational Geometry, 1988, pp. 193–200.Google Scholar
  16. [16]
    Ottman, T., and P. Widmayer, On Translating a Set of Line Segments, Computer Vision, Graphics and Image Processing 24 (1983), pp. 382–389.Google Scholar
  17. [17]
    Sack, J.-R., and G.T. Toussaint, Translating Polygons in the Plane, Proc. 2nd Annual Symp. on Theoretical Aspects of Computer Science, 1985, pp. 310–321.Google Scholar
  18. [18]
    Tarjan, R.E., and C.J. van Wyk, An O(n log log n) Time Algorithm for Triangulating Simple Polygons, SIAM J. Comput. 17 (1988), pp. 143–178.Google Scholar
  19. [19]
    Toussaint, G.T., Movable Separability of Sets, in: G.T. Toussaint (Ed.), Computational Geometry, North Holland, 1985, pp. 335–376.Google Scholar
  20. [20]
    Toussaint, G.T., On Separating Two Simple Polygons by a Single Translation, Techn. Rep. SOCS-88.8, McGill University, 1988.Google Scholar
  21. [21]
    Yao, F.F., On the Priority Approach to Hidden-Surface Algorithms, Proc. 21st Annual IEEE Symp. on Foundations of Computer Science, 1980, pp. 301–307.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Mark de Berg
    • 1
  1. 1.Dept. of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations