Extension of the Nicholls-Lee-Nichols algorithm to three dimensions
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points that are not end points of the output line segment. It also solves all cases more effectively. The performance of this algorithm is shown to be consistently bett...
Saved in:
| Published in: | The Visual computer Vol. 17; no. 4; pp. 236 - 242 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Heidelberg
Springer Nature B.V
01.06.2001
|
| Subjects: | |
| ISSN: | 0178-2789, 1432-2315 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points that are not end points of the output line segment. It also solves all cases more effectively. The performance of this algorithm is shown to be consistently better than that of existing algorithms, including the Cohen–Sutherland, Liang–Barsky, and Cyrus–Beck algorithms. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0178-2789 1432-2315 |
| DOI: | 10.1007/s003710000094 |