The 4th GIS-focused algorithm competition, GISCUP 2015, co-located with ACM SIGSPATIAL GIS 2015 November 3, 2015, Seattla, WA, USA

Introducing the 4th GIS-focused algorithm competition, GISCUP 2015, co-located with ACM SIGSPATIAL GIS 2015.

Submission deadline: August 10, 2015

Call for Participation
Introducing the 4th GIS-focused algorithm competition, GISCUP 2015, co-located with ACM SIGSPATIAL GIS 2015.

With the goal of encouraging innovation in a fun way, ACM SIGSPATIAL is hosting an algorithm contest with winners to be announced at the ACM SIGSPATIAL GIS conference in November 2015. Contest participants will submit original computer programs to be evaluated by the contest organizers on a common dataset.

This year contest will be about finding shortest path under polygonal obstacles. Route planner is one of the most popular web GIS services in use today. Route planner is one of the key functionality offered by the leading web services like Google Maps, MapQuest, and ViaMichelin. Shortest path is one of the core functionality in any route planner. Computing shortest path over a network is a well-studied problem in the literature and as well as widely used online services.

Computing shortest paths in real-time has become a necessity with the advent of online web services. It also became imperative to provide shortest paths under various constraints. Many online services now support variety of constraints, including avoiding tolls and boarders to selecting favorite highways.

Polygonal avoidance is an important problem in selecting shortest paths due to many reasons. Many times, part of the network may have been closed for repairs (static time constraint: during certain period of day/time) or due to emergency situation (dynamic time constraint). Therefore, computing shortest paths that obey both static and dynamic time constraints and avoid regions (polygons) of a network is an important and challenging task. This year SIGPSPATIAL cup seek to address this very important programming challenge.

Top three teams will be provided with cash and or other prizes. In addition to these prizes, the top three teams will be invited to submit a four page paper for a contest paper session to be held at the 2015 ACM SIGSPATIAL GIS conference. These papers will be subject to review and acceptance by the contest organizers, but it is expected that each of the top three teams will have their paper in the conference proceedings, a ten-minute presentation in the contest session, and a poster presentation in the conference's regular poster session.

At least one team member of each winning team must register for the ACM SIGSPATIAL GIS conference.

More information about the contest is here:

Contest Chairs:
Ranga Raju Vatsavai North Carolina State University, Email Contact

Xin Chen Nokia Here, Illinois Institute of Technology, Northwestern University,
Email Contact

Siva Ravada Oracle Corporation, Email Contact

Contest Masters:
Ashwin Shashidharan North Carolina State University, Email Contact

Krishna Karthik Gadiraju North Carolina State University, Email Contact

Review Article Be the first to review this article


Featured Video
GIS Specialist for Metro Wastewater Reclamation District at Denver, Colorado
Upcoming Events
SUE Association at Capitol Skyline Hotel 10 “I” Eye Street, SW Washington, DC - Jul 26, 2018
2018 ENVI Analytics Symposium at The Brown Palace Hotel & Spa Denver CO - Aug 21 - 23, 2018
2018 South Florida GIS Expo at 650 Okeechobee Blvd West Palm Beach FL - Aug 23 - 24, 2018
SPTechCon 2018 at Sheraton Boston Hotel Boston MA - Aug 26 - 29, 2018
Canon: oce crystalPoint
Teledyne Optech

Internet Business Systems © 2018 Internet Business Systems, Inc.
25 North 14th Steet, Suite 710, San Jose, CA 95112
+1 (408) 882-6554 — Contact Us, or visit our other sites:
AECCafe - Architectural Design and Engineering EDACafe - Electronic Design Automation TechJobsCafe - Technical Jobs and Resumes  MCADCafe - Mechanical Design and Engineering ShareCG - Share Computer Graphic (CG) Animation, 3D Art and 3D Models
  Privacy PolicyAdvertise