Submission Closed: All submissions before Aug. 1st have been received. Now we have closed the submission and will release results by the end of this month.

Submission Instructions:

The evaluation process will be conducted using an automatic grader that will test the submitted programs using a collection of test cases in a batch mode. The automatic grader will measure both the accuracy of the generated output and the execution time of the program.

Deadline: Participants should submit their programs by August, 1st 2014

Note: Teams of more than two people or teams with one person can participate in this competition. If the team has more than one person, each participant of the team must be a member of ACM SIGSPATIAL. We usually do not encourage the teams to have more 4 people. Information about membership is provided in
What to submit?
Each participant is expected to submit:

  1. A single .zip file that contains the original Source code and any dependencies. Please include a readme.txt file for any special instructions on how to compile the submitted code. Submission of the source code is mandatory to ensure originality of the submitted work.

  2. A single executable file named: “Simplify.exe”. The Simplyfy.exe accepts three command line parameters. The usage of the Simplify.exe program is as follows:

    Simplify < PointToRemove > < LineInputFilePath > < PointInputFilePath > < OutputFilePath >

    • < PointsToRemove >: Specifiies the minimum number of vertices that must be removed from the input line segments. The program can remove more than this minimum specified number, but it has to remove this minimum number of vertices.

    • < LineInputFilePath > : Specifies the line data file. Each line data file is a single test case and contains a set of line geometries. The example format of the files can be found at Problem Definition section.

    • < PointInputFilePath >: Specifies the point data file. Each points data file is a single test case and contains a set of points. The example format of the files can be found at Problem Definition section.

    • < OutputFilePath >: Specifies the result file where the program is expected to store the output. The example format of the output files can be also found at Problem Definition section.

How to evaluate?

The grading formula is best described by the following algorithm:
      For each result file Output.txt
           For each Line_i in Output.txt
                If (Line_i violates any topological constraints)
                    Nothing changes;
                Else {
                    Score=Score+#Vertices(Original_Line_i) - #Vertices(Line_i);

      If (Score < PointsToRemove)

In plain English, if the produced lines are first checked to make sure they do not violate any of the topological constraints that were present in the input. Then for each line that still satisfies that constraints after simplification, the total number of vertices that are removed from the original line segments are counted. Finally, the grade is weighted by the total execution time of the program. This is repeated for a set of different input cases and final grade is averaged over all the test cases.
All submissions must be compatible with the Microsoft Windows Operating System and will be evaluated using a 4-core (Intel Quad-Core, 64bit) machine running Microsoft Windows 7. Note that the amount of memory consumed by the submitted program should not exceed 1 GB. The programs can be written using any programming language. The requirement is that the submission should have a driver with the given name so that we can run the program using automated scripts.
How to submit?

Submissions must be uploaded through the contest submission site at: