1 / 19

CAD Contest 2013 Problem E: Region Query

CAD Contest 2013 Problem E: Region Query. Ming-Ter Kuo and Abner Huang Synopsys Taiwan Limited. Sponsor: Minister of Education, Republic of China (Taiwan). Outline. Introduction Contest problem Benchmark cases Evaluation metrics Contest results. Introduction – Region Query.

yuri
Download Presentation

CAD Contest 2013 Problem E: Region Query

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CAD Contest 2013Problem E: Region Query Ming-Ter Kuo and Abner Huang Synopsys Taiwan Limited Sponsor: Minister of Education, Republic of China (Taiwan)

  2. Outline • Introduction • Contest problem • Benchmark cases • Evaluation metrics • Contest results

  3. Introduction – Region Query • Searching for objects that intersect a specified window area in two-dimensional space is commonly referred to as region query.

  4. Region Query Commands • Five types of region query commands • Find the polygons contained by a window. • Find the polygons interacting with a window. • Find the polygons interacting with a window that do not overlap with others. • Find the polygons whose area are less than a given number. • Find the percentage (density) of the given window area that are covered by polygons.

  5. Contest Problem • Input data: polygons described by a list of points with two dimensional coordinates. • Query commands: five types of commands with a specified window or area constraint. • FIND_INSIDE • FIND_INTERACT • FIND_NO_OVERLAP • FIND_AREA_LESS_THAN • FIND_DENSITY_INSIDE

  6. Contest Problem • Output: report the number of polygons for polygon queries. For the density query, report the percentage. • Example: • FIND_INSIDE 58 106 137 174 • 10 • FIND_INTERACT 58 106 137 174 • 12 • FIND_NO_OVERLAP 58 106 137 174 • 8 • FIND_AREA_LESS_THAN 20 • 4 • FIND_DENSITY_INSIDE 58 106 137 174 • 12.09%

  7. Benchmark Cases • Each case is run with 500 queries (100 queries per type).

  8. Evaluation Metrics • Correctness: 50% • Score is calculated by the number of correct answers. • Each case must have at least 80% correct answers. • Runtime: 40% • Score is calculated by a normalized runtime factor among all contest programs. • Cutoff time for each case is 1 hour. • Memory usage: 10% • Score is calculated by a normalized peak memory factor among all contest programs.

  9. Team Statistics • Finalists are the teams who have program capability that meets the correctness and runtime criteria.

  10. Case 1: p126430

  11. Case 2: p159909

  12. Case 3: p180378

  13. Case 4: p237960

  14. Case 5: p582110

  15. Case 6: p423850

  16. Total Rank Values • The team with the lowest total rank value wins the contest.

  17. 3rd Place Winners

  18. 2nd Place Winner cadb040 Tin-Yin Lai and Prof. Chia-Tso Chao National Chiao Tung University

  19. 1st Place Winner cadb080 Yu-HaoHuang and Prof. Chia-Tso Chao National Chiao Tung University

More Related