Skip to main content
SpringerLink
Log in
Book cover

Workshop on Computational Geometry

CG 1991: Computational Geometry-Methods, Algorithms and Applications pp 27–35Cite as

An on-line algorithm for constructing sweep planes in regular position

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 553))

Abstract

An algorithm Sweepplane is presented to be used as an auxiliary algorithm by space-sweep algorithms requiring a sweep plane in regular position, i.e., a sweep plane which never meets ≥2 event points at the same time. Sweepplane is an on-line algorithm which ensures that the regular position of the sweep plane is never destroyed by a new event point created during the sweep. If necessary, it dynamically replaces the actual sweep plane by a more suitable one, but always in such a way that the induced order of the event points already swept is maintained.

The authors thank K. Hinrichs and W. Nef for helpful suggestions.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28, 643–647 (1979).

    Google Scholar 

  2. Beretta, G., Meier, A.: Scan Converting Polygons Based on Plane-Sweep. Technical Report 68, Institut für Informatik, ETHZ (1986).

    Google Scholar 

  3. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form. Linear Algebra Appl. 52/53, 69–97 (1983).

    Google Scholar 

  4. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form. Computing 34, 287–302 (1985).

    Google Scholar 

  5. Edelsbrunner, H., Mücke, E.P.: Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 66–104 (1990).

    Article  Google Scholar 

  6. Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153–174 (1987).

    Article  Google Scholar 

  7. Hadwiger, H.: Eulers Charakteristik und kombinatorische Geometrie. J. reine angew. Math. 194, 101–110 (1955).

    Google Scholar 

  8. Hadwiger, H.: Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie. Elem. Math. 23, 121–132 (1968).

    Google Scholar 

  9. Hinrichs, K., Nievergelt, J., Schorn, P.: Plane-sweep solves the closest pair problem elegantly. Information Processing Letters 26, 255–261 (1988).

    Google Scholar 

  10. Hinrichs, K., Nievergelt, J., Schorn, P.: An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. To appear.

    Google Scholar 

  11. Kerr, J.W., Wetzel, J.E.: Platonic divisions of space. Mathematical Magazine 51, 229–234 (1978).

    Google Scholar 

  12. Lee, D.T., Preparata, F.P.: Computational geometry — a survey. IEEE Transactions on Computers C-33, 1072–1101 (1984).

    Google Scholar 

  13. Mehlhorn, K.: Data Structures and Algorithms 3. Multi-dimensional Searching and Computational Geometry. Springer-Verlag 1984.

    Google Scholar 

  14. Müller, H.: Realistische Computergraphik. Algorithmen, Datenstrukturen und Maschinen. Informatik-Fachberichte 163. Springer-Verlag 1988.

    Google Scholar 

  15. Nef, W., Schmidt, P.-M.: Computing a sweeping-plane in regular (“general”) position: A numerical and a symbolic solution. J. Symbolic Computation 10, 633–646 (1990).

    Google Scholar 

  16. Preparata, F.P., Shamos, M.I.: Computational Geometry — An Introduction. Springer-Verlag 1985.

    Google Scholar 

  17. Schmidt, P.-M.: About the Precision of the Coefficients of a Sweeping-Plane. In U. Eckhardt et al. (Eds.): Geometrical Problems of Image Processing. Research in Informatics, Vol. 4, 107–113. Akademie Verlag 1991.

    Google Scholar 

  18. Sedgewick,R.: Algorithms. Addison-Wesley, 2nd Ed. 1988.

    Google Scholar 

  19. Shamos, M.I.: Computational Geometry. Ph.D. Thesis, Yale University, 1978. University Microfilms International.

    Google Scholar 

  20. Wood, D.: Paradigms and Programming with Pascal. Computer Science Press 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und angewandte Mathematik, Universität Bern, Länggassstrasse 51, CH-3012, Bern, Switzerland

    Hanspeter Bieri

  2. Mathematische Fakultät, Friedrich-Schiller-Universität, Universitätshochhaus, 17. OG, D-O-6900, Jena, Germany

    Peter-Michael Schmidt

Authors
  1. Hanspeter Bieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter-Michael Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

H. Bieri H. Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bieri, H., Schmidt, PM. (1991). An on-line algorithm for constructing sweep planes in regular position. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-54891-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54891-1

  • Online ISBN: 978-3-540-46459-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation