Skip to main content
SpringerLink
Log in

A New Coding Scheme for Line Segment Clipping in E2

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2021 (ICCSA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12953))

Included in the following conference series:

Abstract

This contribution presents a new coding scheme based on Cohen-Sutherland line segment clipping algorithm, which enables to distinguish all possible cases easily. It leads to more efficient algorithm for a line segment clipping in E2. It also presents importance of a detailed analysis in algorithm development, if the algorithm robustness and efficiency is required.

Supported by the University of West Bohemia - Institutional research support No. 1311.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andreev, R., Sofianska, E.: New algorithm for two-dimensional line clipping. Comput. Graph. 15(4), 519–526 (1991)

    Article  Google Scholar 

  2. Bui, D., Skala, V.: Fast algorithms for clipping lines and line segments in E2. Vis. Comput. 14(1), 31–37 (1998)

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Day, J.: A new two dimensional line clipping algorithm for small windows. Comput. Graph. Forum 11(4), 241–245 (1992)

    Article  Google Scholar 

  5. Duvanenko, V., Robbins, W., Gyurcsik, R.: Line-segment clipping revisited. Dr. Dobb’s J. 21(1), 107–110 (1996)

    Google Scholar 

  6. Dörr, M.: A new approach to parametric line clipping. Comput. Graph. 14(3–4), 449–464 (1990)

    Article  Google Scholar 

  7. Foley, D., van Dam, A., Feiner, S., Hughes, J.: Computer Graphics: Principles and Practice. Addison-Wesley (1990)

    Google Scholar 

  8. Hughes, J.F., et al.: Computer Graphics: Principles and Practice, 3 edn. Addison-Wesley (2013)

    Google Scholar 

  9. Kaijian, S., Edwards, J., Cooper, D.: An efficient line clipping algorithm. Comput. Graph. 14(2), 297–301 (1990)

    Article  Google Scholar 

  10. Krammer, G.: A line clipping algorithm and its analysis. Comput. Graph. Forum 11(3), 253–266 (1992)

    Article  Google Scholar 

  11. Liang, Y.-D., Barsky, B.: A new concept and method for line clipping. ACM Trans. Graph. (TOG) 3(1), 1–22 (1984)

    Article  Google Scholar 

  12. Nicholl, T.M., Lee, D., Nicholl, R.A.: Efficient new algorithm for 2D line clipping: its development and analysis. Comput. Graph. (ACM) 21(4), 253–262 (1987)

    Article  Google Scholar 

  13. Nielsen, H.: Line clipping using semi-homogeneous coordinates. Comput. Graph. Forum 14(1), 3–16 (1995)

    Article  Google Scholar 

  14. Rappoport, A.: An efficient algorithm for line and polygon clipping. Vis. Comput. 7(1), 19–28 (1991)

    Article  Google Scholar 

  15. Skala, V.: Algorithm for 2D line clipping. In: Earnshaw, R.A., Wyvill, B. (eds.) New Advances in Computer Graphics, NATO ASI, pp. 121–128 (1989). https://doi.org/10.1007/978-4-431-68093-2_7

  16. Skala, V.: Algorithms for clipping quadratic arcs. In: Chua, T.-S., Kunii, T.L. (eds.) CG International ’90. pp, pp. 255–268. Springer, Tokyo (1990). https://doi.org/10.1007/978-4-431-68123-6_16

    Chapter  Google Scholar 

  17. Skala, V.: An efficient algorithm for line clipping by convex polygon. Comput. Graph. 17(4), 417–421 (1993)

    Article  Google Scholar 

  18. Skala, V.: O(lg N) line clipping algorithm in E2. Comput. Graph. 18(4), 517–524 (1994)

    Article  Google Scholar 

  19. Skala, V.: An efficient algorithm for line clipping by convex and non-convex polyhedra in E3. Comput. Graph. Forum 15(1), 61–68 (1996)

    Article  Google Scholar 

  20. Skala, V.: Line clipping in E2 with O(1) processing complexity. Comput. Graph. (Pergamon) 20(4), 523–530 (1996)

    Article  Google Scholar 

  21. Skala, V.: A fast algorithm for line clipping by convex polyhedron in E3. Comput. Graph. (Pergamon) 21(2), 209–214 (1997)

    Article  Google Scholar 

  22. Skala, V.: A new approach to line and line segment clipping in homogeneous coordinates. Vis. Comput. 21(11), 905–914 (2005)

    Article  Google Scholar 

  23. Skala, V.: Length, area and volume computation in homogeneous coordinates. Int. J. Image Graph. 6(4), 625–639 (2006)

    Article  Google Scholar 

  24. Skala, V.: Barycentric coordinates computation in homogeneous coordinates. Comput. Graph. (Pergamon) 32(1), 120–127 (2008)

    Article  Google Scholar 

  25. Skala, V.: Intersection computation in projective space using homogeneous coordinates. Int. J. Image Graph. 8(4), 615–628 (2008)

    Article  Google Scholar 

  26. Skala, V.: Optimized line and line segment clipping in E2 and geometric algebra. Ann. Math. Inform. 52, 199–215 (2020)

    MathSciNet  MATH  Google Scholar 

  27. Skala, V.: A novel line convex polygon clipping algorithm in E2 with parallel processing modification. In: Gervasi, O., et al. (eds.) ICCSA 2021. LNCS, vol. 12953, pp. 3–15. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86976-2_1

  28. Skala, V., Bui, D.: Extension of the Nicholls-Lee-Nichols algorithm to three dimensions. Vis. Comput. 17(4), 236–242 (2001)

    Article  Google Scholar 

  29. Sobkow, M., Pospisil, P., Yang, Y.-H.: A fast two-dimensional line clipping algorithm via line encoding. Comput. Graph. 11(4), 459–467 (1987)

    Article  Google Scholar 

Download references

Acknowledgment

The author would like to thank to colleagues at the University of West Bohemia in Plzen for fruitful discussions and to anonymous reviewers for their comments and hints, which helped to improve the manuscript significantly.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of West Bohemia, 301 00, Pilsen, Czech Republic

    Vaclav Skala

Authors
  1. Vaclav Skala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vaclav Skala .

Editor information

Editors and Affiliations

  1. University of Perugia, Perugia, Italy

    Osvaldo Gervasi

  2. University of Basilicata, Potenza, Potenza, Italy

    Beniamino Murgante

  3. Covenant University, Ota, Nigeria

    Sanjay Misra

  4. University of Cagliari, Cagliari, Italy

    Chiara Garau

  5. University of Cagliari, Cagliari, Italy

    Ivan Blečić

  6. Monash University, Clayton, VIC, Australia

    David Taniar

  7. Kyushu Sangyo University, Fukuoka, Japan

    Bernady O. Apduhan

  8. University of Minho, Braga, Portugal

    Ana Maria A. C. Rocha

  9. Polytechnic University of Bari, Bari, Italy

    Eufemia Tarantino

  10. Polytechnic University of Bari, Bari, Italy

    Carmelo Maria Torre

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Skala, V. (2021). A New Coding Scheme for Line Segment Clipping in E2. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2021. ICCSA 2021. Lecture Notes in Computer Science(), vol 12953. Springer, Cham. https://doi.org/10.1007/978-3-030-86976-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86976-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86975-5

  • Online ISBN: 978-3-030-86976-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation