Line clipping based on parallelism approach and midpoint intersection

This algorithm performs line clipping against four perpendicular sides that are parallel to the screen. The algorithm combines different types of line and define which line or part of line saved for display. The main property is considered in this algorithm is the parallelism with window boundary to...

Full description

Bibliographic Details
Main Authors: Hattab, Adel Salem Abdullah, Yusof, Yuhanis
Format: Conference or Workshop Item
Language:English
Published: 2014
Subjects:
Online Access:https://repo.uum.edu.my/id/eprint/17114/1/1.pdf
_version_ 1825803822197374976
author Hattab, Adel Salem Abdullah
Yusof, Yuhanis
author_facet Hattab, Adel Salem Abdullah
Yusof, Yuhanis
author_sort Hattab, Adel Salem Abdullah
collection UUM
description This algorithm performs line clipping against four perpendicular sides that are parallel to the screen. The algorithm combines different types of line and define which line or part of line saved for display. The main property is considered in this algorithm is the parallelism with window boundary to define the clipped line.For parallel lines with window boundaries no need to use intersection point method to find the coordinates of the end points of the clipped line.Midpoint algorithm is used to determine the intersection point with the clipped boundary for non-parallel lines. In this algorithm there are no area codes to determine the position of end points of line.
first_indexed 2024-07-04T06:04:16Z
format Conference or Workshop Item
id uum-17114
institution Universiti Utara Malaysia
language English
last_indexed 2024-07-04T06:04:16Z
publishDate 2014
record_format eprints
spelling uum-171142016-05-17T07:23:06Z https://repo.uum.edu.my/id/eprint/17114/ Line clipping based on parallelism approach and midpoint intersection Hattab, Adel Salem Abdullah Yusof, Yuhanis QA76 Computer software This algorithm performs line clipping against four perpendicular sides that are parallel to the screen. The algorithm combines different types of line and define which line or part of line saved for display. The main property is considered in this algorithm is the parallelism with window boundary to define the clipped line.For parallel lines with window boundaries no need to use intersection point method to find the coordinates of the end points of the clipped line.Midpoint algorithm is used to determine the intersection point with the clipped boundary for non-parallel lines. In this algorithm there are no area codes to determine the position of end points of line. 2014 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/17114/1/1.pdf Hattab, Adel Salem Abdullah and Yusof, Yuhanis (2014) Line clipping based on parallelism approach and midpoint intersection. In: 3rd International Conference on Mathematical Sciences (ICMS3), 17–19 December 2013, Kuala Lumpur, Malaysia. http://doi.org/10.1063/1.4882513 doi:10.1063/1.4882513 doi:10.1063/1.4882513
spellingShingle QA76 Computer software
Hattab, Adel Salem Abdullah
Yusof, Yuhanis
Line clipping based on parallelism approach and midpoint intersection
title Line clipping based on parallelism approach and midpoint intersection
title_full Line clipping based on parallelism approach and midpoint intersection
title_fullStr Line clipping based on parallelism approach and midpoint intersection
title_full_unstemmed Line clipping based on parallelism approach and midpoint intersection
title_short Line clipping based on parallelism approach and midpoint intersection
title_sort line clipping based on parallelism approach and midpoint intersection
topic QA76 Computer software
url https://repo.uum.edu.my/id/eprint/17114/1/1.pdf
work_keys_str_mv AT hattabadelsalemabdullah lineclippingbasedonparallelismapproachandmidpointintersection
AT yusofyuhanis lineclippingbasedonparallelismapproachandmidpointintersection