Skip to main content

Advertisement

Log in

Fast algorithms for clipping lines and line segments in E2

  • Published:
The Visual Computer Aims and scope Submit manuscript

E

2 are presented. The suggested algorithms are based on a technique of coding the line direction together with the end points of the clipped line segment. They solve all cases more effectively. The algorithms are convenient for clippings lines or line segments by rectangle. Theoretical considerations and experimental results are also presented.

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

Access this article

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bui, D., Skala, V. Fast algorithms for clipping lines and line segments in E2. The Visual Computer 14, 31–38 (1998). https://doi.org/10.1007/s003710050121

Download citation

  • Issue Date:

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