This browser does not have a Java Plug-in.
Get the latest Java Plug-in here.


Project P2 for CS6491 Fall 2009: Robust point-in-polygon

Teams of 1 or 2 students (your choice).

Change the provided applet (zip) by implementing a robust point-in-polygon test (provide the content of the PiP function in the PiP tab). Test it by pressing 'p' that toggles between the naive code provided and yours.

Provide the link to a short 5mns or less video in which all members of the team contribute to explain the following (using the white board, animations, slides):
  • Definition of a polygon and its intuitive explanation and justification
  • Three different representations of a polygon
  • Three different algorithms for testing whether a point Q lies inside the polygon (they may work off the same or different representations)
  • The details of the algorithm you have implemented in the applet

    Post a web page with the applet and a link to the video and the proper header (including the names and pictures of the team members).

    Built by Jarek Rossignac with Processing