Line clipping in E2 with O(1) processing complexity

Computers and Graphics (Pergamon)

Volumn 20, Issue 4, 1996, Pages 523-530

  Skala, Václav ^a  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS;

DUAL SPACE REPRESENTATION; LINE CLIPPING; SPACE SUBDIVISION TECHNIQUE;

COMPUTER GRAPHICS;

EID: 0030182164     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/0097-8493(96)00024-6     Document Type: Article

References (11)

1. 2. Computers & Graphics 18, 517-524 (1994).
2. J. Stolfi, Primitives for computational geometry. Report 36, SRC DEC System Research Center (1989).
3. S. Zachariáš, Duality and Complexity (in Czech). TR 81/95, Universiy of West Bohemia, Plzeň (1995).
4. H. P. Nielsen, Line clipping using semi-homogeneous coordinates. Computer Graphics Forum 14, 3-16 (1995).
5. I. Kolingerová, Dual Representation and its Usage in Computer Graphics. PhD Thesis (in Czech), University of West Bohemia, Plzeň (1994).
6. S. Zachariáš, Projection in Barycentric Coordinates, submitted to WSCG96 International Conference, University of West Bohemia, Plzeň (1995).
7. V. Skala, Point-in-Polygon with O(1) Complexity. TR 68/94, University of West Bohemia, Plzeň (1994).
8. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag (1985).
9. V. Skala, An efficient algorithm for line clipping by convex polygon. Computers & Graphics 17, 417-421 (1993).
10. V. Skala, I. Kolingerová and P. Bláha, A comparison of 2D line clipping algorithms. Machine Graphics and Vision 3, 625-633 1995).
11. 2, submitted SSCG96 International Conference, Slovak Republic (1995).