Extension of the Nicholls-Lee-Nichols algorithm to three dimensions

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Visual computer 2001-06, Vol.17 (4), p.236-242
Hauptverfasser: Skala, Václav, Bui, Duc Huy
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Segments
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0178-2789
1432-2315
DOI:10.1007/s003710000094