VT - Weiler-Atherton Clipping

Link(s)
http://research.cs.vt.edu/AVresearch/WAclip
Topic(s)
Clipping, Computer Graphics, Weiler–Atherton clipping algorithm, Computational Geometry

Screenshots
VT - Weiler-Atherton Clipping
Videos
See video


Recommendation
  
Lecture Aide Recommended
Self-study Supplement Recommended
Standalone Has Potential
Debugging Aide Has Potential
Works?
Yes
Delivery Method(s)
Java Applet
Project
Virginia Tech Algorithm Visualizations
Project Relationship
Part of collection
Language(s)
English
Author(s)
Christopher Andrews
Institution(s)
Virginia Tech
Activity Level(s)
Step control, User data
Source Code License
Licensed under Creative Commons
First Published
2008-05
Last Modified
2011-01-12

Description

Demonstration of the Weiler-Atherton clipping algorithm for two polygons. User first enters two polygons by specifying the vertices on the screen, and then the AV walks through the steps of the algorithm. While it presents as a Java applet, its actually written in Jython.

Evaluation

This AV provides a clear explaination for a fairly complex algorithm. The presentation is not just limited to a canned example, it allows the user to enter two polygons to be clipped. Entering reasonably complex polygons is surprisingly easy (though the user needs to be careful that the polygons remain simple). The step-by-step walkthrough of the algorithm is quite clear, with a detailed description of what is happening at each step presented in a side panel. There is little interaction aside from advancing the action. While there is no tutorial explaining the context of the algorithm, this is fairly straightforward to understand from the activity of the applet.

Usage Notes

This is an applet, and should come up in a separate window automatically when you follow the link. It might take a little while to load.

Field Report(s)
References
N/A
Rating
5
Average: 5 (2 votes)
Your rating: None
AV of the Day
No
Score
59