An efficient implementation of parametric line and polygon clipping algorithm

Authors:
Mingjun Zhang;Chaman L. Sabharwal
Affiliations:
PRI Automation/OEM Divison, Mountain View, CA;University of Missouri, Rolla, MO
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 5
Cited 0

Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
A new, fast method for 2D polygon clipping: analysis and software implementation

ACM Transactions on Graphics (TOG)
A New Concept and Method for Line Clipping

ACM Transactions on Graphics (TOG)
An analysis and algorithm for polygon clipping

Communications of the ACM
Reentrant polygon clipping

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

An improved parametric line clipping algorithm is presented. The line clipping algorithm is extended to polygon clipping. The implementations of both the algorithms are novel and outperform many previous algorithms in the literature. This is supported by theoretical consideration and experimental results on randomly selected lines and polygons. The algorithms are implemented in Java. The Java applet allows the user to visualize the experimental results by comparing the existing algorithms and the new algorithms.