- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Proposed algorithm to decrease the intersection points in Cohen algorithm for clipping | ||
| Journal of Basrah Researches (Sciences) | ||
| Article 1, Volume 34, Issue 3, 2008, Pages 1-13 PDF (0 K) | ||
| Authors | ||
| Bushra M. Hassan; Yusra M.Dhamed; | ||
| Abstract | ||
| There isn't any drawing software without line clipping routines, it is very important processing because it can use to clip part or parts from the displayed image in order to maximize or minimize it or to do any processing with it. There are many algorithms which process clipping problem like Cohen algorithm which suffer from many intersection problem which make drag in finding the part which we want to clip right way. Another algorithms appeared to improve its work like Liang-Barsky and NLN algorithms but they all need the approximation solution in decreasing the intersection points. The proposed algorithm solved the problem in easy and quick way, it can decrease the intersection points calculating by separating the lines according to their properties and divide the region to critical and not critical parts in order to know the real or virtual intersection points(active and inactive)and find the real parts within the clipping window boundaries. This processing cooperate in decreasing the repetitive intersection points which the previous algorithm lay in it.The forgoing have been formulated in C++ language. | ||
| Keywords | ||
| Clipping; viewing transformation; Cohen algorithm; Liang; Barsky algorithm; NLN algorithm | ||
|
Statistics Article View: 120 PDF Download: 48 |
||