2013/Spring        Topics in Computer Graphics

 

Overview

In this course we will employ principles and algorithms from computational geometry, computer graphics and interactive techniques in different ways. The goal is to provide students a hands-on and practical experience with issues related to computer graphics and computational geometry. The students will be required to implement an algorithm and to experiment with it.

Course Structure

The course includes presentation of preliminary material and suggested projects, and then independent work by student pairs on specific projects. After the first two meetings that will serve as introductory lectures, personal meetings with the groups will occur once every three weeks. On the first meetings the assignment of papers to pairs of students will take place. Each consequent meeting will be devoted to status update: each project team will describe its progress, and its problems. These update meetings will have a double goal: first to help the pairs that are stuck to advance, and second to evaluate the progress of each pair. The last meeting will be devoted to presentations of the final projects.

Important Dates and Evaluations

·        2,6.5.2013 – Alpha Version: which includes running code and work plane (as MS-Word/PDF file)

·        8,15.7.2013 - Final Version, which includes working code (bug-free) and documentation.

Topics

	Visualization of Space-Time in General Relativity
	3D Delaunay/Voronoi Anomaly Detection
	EasyRead: Document Zoom and Navigation
	T10: an extended text corrector
	4D Delauny/Voronoi Visualization

Papers

1.      Speed-dependent automatic zooming for browsing large documents
Takeo Igarashi, Ken Hinckley
Symposium on User Interface Software and Technology, ACM UIST'00

 

2.      QHull: http://www.qhull.org/

 

3.     Dictionary for T10 project:


1. Download the whole package: http://www.cs.bgu.ac.il/~adlerm/dat/tagger.zip

            2. The following program demonstrates how to use the lexicon in order to get the known analysis from a given word, and how to determine whether a given word    is unknown.

            3. The class path for the program should be linked to tagger.jar which is included in the package, and the directory of the extracted package should be provided      as args[0]

 

           

       public static void main(String[] args) throws Exception {

 

            if (args.length != 2 && args.length != 1) {

                      System.err.println("Usage: java -cp tagger.jar XX:MaxPermSize=256m vohmm.lexicon.BGULexicon <lexicon dir>");

                      System.exit(0);

            }

 

                String dir = args[0];

                String lexicon = dir + "/lexicon";

                String knownbitmasks = dir + "/known-bitmasks";

                vohmm.lexicon.BGULexicon lex = vohmm.lexicon.BGULexicon.fromFile(lexicon);

                lex.setKnownBitmasks(knownbitmasks);

                Token token = lex.getTokenAnalysis("אתם",false,false);

                System.out.println(token);

                boolean bHasAnalysis = lex.isUnknown("אינטרפולציה");

                System.out.println("Has analysis?" + bHasAnalysis);

        }