The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

JHAVÉ - Sutherland-Hodgman Clipping Algorithm

Link(s)
http://jhave.org/learner/misc/sutherlandhodgman/sutherlandhodgmanclipping.shtml
Topic(s)
Computer Graphics

Screenshots
Sutherland-Hodgman Clipping Algorithm AV
Videos


Recommendation
  
Lecture Aide Recommended
Self-study Supplement Recommended
Standalone Recommended
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Application
Project
JHAVÉ
Project Relationship
Part of collection
Language(s)
English
Author(s)
Alejandro Carrasquilla, Shawn Recker
Institution(s)
University of Wisconsin - Oshkosh, Grove City College
Activity Level(s)
Exploration, Questions
Source Code License
Licensed under GPL
First Published
2010-07-31
Last Modified
2010-07-31

Description

This AV uses the JHAVE system for a visualization of the Sutherland Hodgman Clipping algorithm. The implementation supports a graphical visualization of the operations within the algorithm, a series of pop-up questions to test basic user understanding of the algorithm, and a list of exercises which demonstrate a deeper understanding of the algorithm presented. In standard mode, the visualization generates polygons and steps through each operation of the algorithm. Pop-up questions are also supported in this portion of the visualization. In exercise mode however, the user is given some constraints and asked to produce polygons which adhere to the specified constraint. In free mode, the user can enter two polygons and various statistics are kept.

Evaluation

This is an AV integrated into a hypertext lesson on the Sutherland-Hodgman clipping algorithm. The viewer must first read the hypertext lesson to gain some familiarity with the algorithm. As a lecture aid, it could be used in "free mode" in which the user has complete freedom in choosing the vertices for the subject and clipping polygons. As a study aid, the AV has two distinct modes of use. In pop-up question mode, the viewer must respond to relatively straightforward questions that test their basic understanding of the algorithm. In exercise mode the user must design input sets for the algorithm to direct its execution in a variety of way. This mode requires a deeper understanding. The authors of the AV correlate these two modes of use with progressively deeper levels of understanding in Bloom's taxonomy. The most outstanding aspects of this AV are the variety of levels of participation whereby the user becomes engaged with it, thereby learning the algorithm instead of merely "watching it".

Usage Notes

In general the modes of using the AV have already been described above. To illustrate these usage modes, the authors of the AV have made a four-minute use-case video available at

  

http://www.youtube.com/watch?v=2ECuoMGhj2U

Field Report(s)
References
N/A
Rating
3.333335
Average: 3.3 (3 votes)
Your rating: None
AV of the Day
Yes
Score
58