Skip to main content

Line Clipping Algorithm of Affine Transformation for Polygon

  • Conference paper
Book cover Intelligent Computing Theories (ICIC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7995))

Included in the following conference series:

Abstract

Applying affine transformations to polygon (concave or convex) and line segment, the algorithm of this paper obtains the points of intersection of the polygon and the line segment. Having tested the line segment with a bounding box which includes the polygon, the algorithm applies the affine transformation to the polygon and the line segment; in the polygon, the algorithm finds the edges which intersect the straight line. The algorithm applies another affine transformation to the edges, and obtains the points of intersection of the polygon and the line segment. Finally, The algorithm applies the reverse affine transformations to the points , and obtains the intersection points of the original polygon and the original line segment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Skala, V.: O(lgN) line clipping algorithm in E2. Computers & Graphics 18(4), 517–527 (1994)

    Article  Google Scholar 

  2. Skala, V.: A New Approach To Line And Line Segment Clipping in Homogeneous Coordinates. Visual Computer 21(11), 905–914 (2005)

    Article  Google Scholar 

  3. Tang, J., Zhang, Q., Sun, H.: A Clipping Algorithm Based on Cross Product Method for Convex Polygon Window. Journal of Northeast Heavy Machinery Institute 19(1), 23–25 (1995)

    Google Scholar 

  4. Han, J., Ge, Y., Zhang, D.: An Algorithm for Vector Graphic Based a polygon Window. Journal of Taiyuan University of Technology 36(2), 160–163 (2005)

    Google Scholar 

  5. Ren, H.: Line Clipping Algorithm Against a Polygon Based on Point Region Distributing. Science Technology and Engineering 9(16), 4833–4835 (2009)

    Google Scholar 

  6. Lu, G., Xing, S., Peng, Q.: An Efficient Algorithm of Line Clipping Against Polygonal Window Based on the Vertex Encoding. Chinese Journal of Computers 25(9), 987–993 (2002)

    MathSciNet  Google Scholar 

  7. Li, W.: A Scan Strip Based Algorithm for Line Clipping against Arbitrary Polygons. Journal of Engineering Graphics (2), 35–40 (2005)

    Google Scholar 

  8. Li, J., Wang, W., Wu, E.: Line Clipping Against a Polygon Based on Convex Decomposition. Journal of Computer Aided Design & Computer Graphics 19(4), 425–429 (2007)

    Google Scholar 

  9. Huang, Y.Q., Liu, Y.K.: An Algorithm for the Clipping Against a Polygon Based on Shearing Transformation. Computer Graphics Forum 21(4), 683–688 (2002)

    Article  Google Scholar 

  10. Huang, W.: The Line Clipping Algorithm Basing on Affine Transformation. Intelligent Information Management 2(6), 35 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, W. (2013). Line Clipping Algorithm of Affine Transformation for Polygon. In: Huang, DS., Bevilacqua, V., Figueroa, J.C., Premaratne, P. (eds) Intelligent Computing Theories. ICIC 2013. Lecture Notes in Computer Science, vol 7995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39479-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39479-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39478-2

  • Online ISBN: 978-3-642-39479-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics