Skip to main content
SpringerLink
Log in

3D-line clipping algorithms — a comparative study

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Some well-known line-polyhedron intersection methods are summed up and new accelerating modifications presented. Results of comparison of known and newly developed methods are included. New methods use the fact that each line can be described as the intersection of two planes.

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

Access this article

Log in via an institution

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 KQ (1979) Geometric transformations for fast geometric algorithms. PhD. dissertation, Carnegie-Mellon University Pittsburg

    Google Scholar 

  2. Cyrus M, Beck J (1979) Generalized two and three dimensional clipping. Comput Graph 3:23–28

    Google Scholar 

  3. Günther O (1988) Efficient data structures for geometric data management. Springer, Berlin Heidelberg New York

    Google Scholar 

  4. Kolingerová I (1993) Speeding up ray tracing for convex polyhedra. Proceedings from the Conference Computer Graphics '93, Bratislava, pp. 127–28

  5. Kolingerová I (1994) Dual transformation and its application to computer graphics. In: Skala V (ed) Closing report to grant no. 151, appendix, Pilsen UWB (in Czech)

  6. Kolingerová I (1994) Computer graphics problems solution using dual representation. PhDr. thesis, UWB Pilsen (in Czech)

  7. Melhorn K (1984) Data structures and algorithms 3: Multidimensional Searching and Computational Geometry, Springer, Berlin Heidelberg New York

    Google Scholar 

  8. Nielsen HP (1994) Line clipping using semi-homogenous coordinates, submitted for publication in Computer Graphics Forum.

  9. Nielsen HP (1994) An intersection test using dual figures, DTU-GK Report, Lyngby

  10. Preparata PF, Shamos MI (1985) Computational geometry, an introduction. Springer, Berlin Heidelberg New York

    Google Scholar 

  11. Skala V (1994) O(lgN) Line clipping algorithm. Accepted for publication in Comput Graph 18. Other publications related to the given topic see in Skala (1994).

Download references

Author information

Authors and Affiliations

  1. Department of Informatics and Computer Science, University of West Bohemia, Americká 42, 305 14, Plzeň, Czech Republic

    Ivana Kolingerová

Authors
  1. Ivana Kolingerová
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolingerová, I. 3D-line clipping algorithms — a comparative study. The Visual Computer 11, 96–104 (1994). https://doi.org/10.1007/BF01889980

Download citation

  • Issue Date:

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

Key words

Search

Navigation