Skip to main content
Springer Nature Link
Log in

A fast line-sweep algorithm for hidden line elimination

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Fast hidden line elimination algorithms can be obtained by minor modifications to algorithms developed for reporting intersections of polygons. We show how the same modifications which have been applied to segment trees can be applied to the data structure of Swart and Ladner as well, leading to anO((n+k)logn) time hidden line elimination algorithm (n is the number of boundary edges of the input polygons andk is the number of intersections of the edges on the projection plane). The algorithm improves the fastest previous line-sweep algorithm for the problem by a factorO(logn).

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brown, K. Q.,Comments on “Algorithms for reporting and counting geometric intersections”. IEEE Transactions on Computers, C-30 (1981), 147–148.

    Google Scholar 

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

    Google Scholar 

  3. Bentley, J. L. and D. Wood,An optimal worst-case algorithm for reporting intersections of rectangles. IEEE Transactions on Computer, C-29 (1980) 571–577.

    Google Scholar 

  4. Edelsbrunner, H.,Dynamic data structures for orthogonal intersection queries. Report 59, Institut für Informationsverarbeitung, University of Graz, Austria, 1980.

    Google Scholar 

  5. Hamlin, G. and C. W. Gear,Raster-scan hidden surface algorithm techniques. Computer Graphics 11 (1977), 206–213.

    Google Scholar 

  6. McCreight, E. M.,Efficient algorithms for enumerating intersecting intervals and rectangles. Report CSL-80-9, Xerox PARC, 1980.

  7. Ottmann, Th. and P. Widmayer,Solving visibility problems by using skeleton structures. Proceedings of the 11th Symposium on the Mathematical Foundations of Computer Science (1984), 459–470.

  8. Sechrest, S. and D. P. Greenberg,A visible polygon reconstruction algorithm. Computer Graphics 15 (1981), 17–21.

    Google Scholar 

  9. Swart, G. and R. Ladner,Efficient algorithms for reporting intersections. Technical Report No. 83-07-03, Computer Science Department, University of Washington, Seattle, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6380, D-7500, Karlsruhe, West Germany

    Otto Nurmi

Authors
  1. Otto Nurmi
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This work was supported by the grant Ot 64/4-2 from the Deutsche Forschungsgemeinschaft.

On leave from the Department of Computer Science, University of Helsinki, Finland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nurmi, O. A fast line-sweep algorithm for hidden line elimination. BIT 25, 466–472 (1985). https://doi.org/10.1007/BF01935366

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01935366

Keywords