EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE TO FACILITATE DISPLAYING GEOGRAPHIC DATA

• US 20160217151A1
• Filed: 01/27/2015
• Published: 07/28/2016
• Est. Priority Date: 01/27/2015
• Status: Active Grant

• Current Assignee: Splunk Inc.
• Original Assignee: Splunk Inc.
• Inventors: Hendrey, Geoffrey R.
• Granted Patent: US 9,767,122 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G09G 5/003 Details of a display terminal, the details relating to the control arrangement of the display terminal and to the interfaces thereto specific for a CRT G09G1/165; for a flat panel G09G3/2092
• CPC Class Codes: G09G 5/02 characterised by the way in which colour is displayed details of colour display specific for CRTs G09G1/28; specific for flat matrix panels other than liquid crystal displays G09G3/2003; specific for liquid crystal displays G09G3/3607

Abstract

A system that displays geographic data is disclosed. The system obtains polygons that define a set of geographic regions. Then, the system projects rays from endpoints of the line segments that define the polygons onto a reference line to form intersection points. For each interval between pairs of consecutive intersection points on the reference line, the system keeps track of open line segments that project onto the interval. For each data point in a set of data points, the system identifies a relevant interval on the reference line that the data point projects onto, and performs a crossing number operation to identify polygons that the data point falls into, and the system increments a count for each polygon that the data point falls into. Finally, the system displays the set of geographic regions in a manner that indicates a number of data points that fall into each geographic region.

Claims

1. A computer-implemented method for displaying geographic data, comprising:

obtaining a set of polygons that define a set of geographic regions, wherein each polygon comprises line segments that define a border of the polygon, and wherein each line segment is defined by coordinates for two endpoints of the line segment;

projecting rays from the endpoints of the line segments that comprise the set of polygons onto a reference line, wherein the rays are projected in a direction orthogonal to the reference line to form intersection points with the reference line;

for each interval between pairs of consecutive intersection points on the reference line, keeping track of open line segments that project onto the interval;

for each data point in a set of data points to be processed,

identifying a relevant interval on the reference line that the data point projects onto,

performing a crossing number (CN) operation by counting intersections between a ray projected from the data point and open line segments associated with the relevant interval to identify zero or more polygons that the data point falls into, and

incrementing a count for each polygon that the data point falls into; and

displaying the set of geographic regions, wherein each polygon that defines a geographic region is marked to indicate a number of data points that fall into the polygon.

2. The computer-implemented method of claim 1, wherein displaying the set of geographic regions includes displaying a choropleth map wherein each geographic region is shaded, patterned or colored in proportion to a number of data points that fall into the geographic region.

3. The computer-implemented method of claim 1, wherein the reference line is an X coordinate axis.

4. The computer-implemented method of claim 1, wherein the reference line is a Y coordinate axis.

5. The computer-implemented method of claim 1, wherein determining the relevant interval for the data point includes performing a binary search through an array containing the intersection points on the reference line.

6. The computer-implemented method of claim 1, wherein keeping track of the open line segments that project onto the intervals includes maintaining a list of open line segments for every nth interval on the reference line.

7. The computer-implemented method of claim 1,

wherein keeping track of the open line segments that project onto the intervals includes maintaining a list of open line segments for every nth interval on the reference line;

and

wherein identifying a relevant interval for a data point includes obtaining a list of open intervals for a nearest nth interval on the reference line, and adjusting the list to account for intervening line segment openings and closings associated with intersection points located between the nearest nth interval and the relevant interval on the reference line to produce a list of open intervals for the relevant interval.

8. The computer-implemented method of claim 1,

wherein prior to performing the CN operation for each data point, the set of data points is sorted based on an ordering of projections of the set of data points on the reference line;

and

wherein the set of data points are processed in the sorted order to facilitate reducing an average amount of time required to identify a relevant interval for each data point.

9. The computer-implemented method of claim 1, wherein prior to processing the set of data points, the method further comprises obtaining the set of data points by:

receiving a query to be processed, wherein the query is associated with the set of geographic regions; and

using a late-binding schema generated from the query to retrieve the set of data points from a set of events containing previously gathered data.

10. The computer-implemented method of claim 1, wherein obtaining the set of polygons includes retrieving the set of polygons from a geographic database.

11. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for displaying geographic data, the method comprising:

obtaining a set of polygons that define a set of geographic regions, wherein each polygon comprises line segments that define a border of the polygon, and wherein each line segment is defined by coordinates for two endpoints of the line segment;

projecting rays from the endpoints of the line segments that comprise the set of polygons onto a reference line, wherein the rays are projected in a direction orthogonal to the reference line to form intersection points with the reference line;

for each interval between pairs of consecutive intersection points on the reference line, keeping track of open line segments that project onto the interval;

for each data point in a set of data points to be processed,

identifying a relevant interval on the reference line that the data point projects onto,

performing a crossing number (CN) operation by counting intersections between a ray projected from the data point and open line segments associated with the relevant interval to identify zero or more polygons that the data point falls into, and

incrementing a count for each polygon that the data point falls into; and

displaying the set of geographic regions, wherein each polygon that defines a geographic region is marked to indicate a number of data points that fall into the polygon.

12. The non-transitory computer-readable storage medium of claim 11, wherein displaying the set of geographic regions includes displaying a choropleth map wherein each geographic region is shaded, patterned or colored in proportion to a number of data points that fall into the geographic region.

13. The non-transitory computer-readable storage medium of claim 11, wherein the reference line is an X coordinate axis.

14. The non-transitory computer-readable storage medium of claim 11, wherein the reference line is a Y coordinate axis.

15. The non-transitory computer-readable storage medium of claim 11, wherein determining the relevant interval for the data point includes performing a binary search through an array containing the intersection points on the reference line.

16. The non-transitory computer-readable storage medium of claim 11, wherein keeping track of the open line segments that project onto the intervals includes maintaining a list of open line segments for every nth interval on the reference line.

17. The non-transitory computer-readable storage medium of claim 11,

wherein keeping track of the open line segments that project onto the intervals includes maintaining a list of open line segments for every nth interval on the reference line;

and

wherein identifying a relevant interval for a data point includes obtaining a list of open intervals for a nearest nth interval on the reference line, and adjusting the list to account for intervening line segment openings and closings associated with intersection points located between the nearest nth interval and the relevant interval on the reference line to produce a list of open intervals for the relevant interval.

18. The non-transitory computer-readable storage medium of claim 11,

wherein prior to performing the CN operation for each data point, the set of data points is sorted based on an ordering of projections of the set of data points on the reference line;

and

wherein the set of data points are processed in the sorted order to facilitate reducing an average amount of time required to identify a relevant interval for each data point.

19. The non-transitory computer-readable storage medium of claim of claim 11, wherein prior to processing the set of data points, the method further comprises obtaining the set of data points by:

receiving a query to be processed, wherein the query is associated with the set of geographic regions; and

using a late-binding schema generated from the query to retrieve the set of data points from a set of events containing previously gathered data.

20. The non-transitory computer-readable storage medium of claim of claim 11, wherein obtaining the set of polygons includes retrieving the set of polygons from a geographic database.

21. A system that displays geographic data, comprising:

at least one processor and at least one associated memory; and

a display mechanism that executes on the at least one processor and is configured to;

obtain a set of polygons that define a set of geographic regions, wherein each polygon comprises line segments that define a border of the polygon, and wherein each line segment is defined by coordinates for two endpoints of the line segment;

project rays from the endpoints of the line segments that comprise the set of polygons onto a reference line, wherein the rays are projected in a direction orthogonal to the reference line to form intersection points with the reference line;

for each interval between pairs of consecutive intersection points on the reference line, keep track of open line segments that project onto the interval;

for each data point in a set of data points to be processed,

identify a relevant interval on the reference line that the data point projects onto,

perform a crossing number (CN) operation by counting intersections between a ray projected from the data point and open line segments associated with the relevant interval to identify zero or more polygons that the data point falls into, and

increment a count for each polygon that the data point falls into; and

display the set of geographic regions, wherein each polygon that defines a geographic region is marked to indicate a number of data points that fall into the polygon.

22. The system of claim 21, wherein while displaying the set of geographic regions, the display mechanism is configured to display a choropleth map wherein each geographic region is shaded, patterned or colored in proportion to a number of data points that fall into the geographic region.

23. The system of claim 21, wherein the reference line is an X coordinate axis.

24. The system of claim 21, wherein the reference line is a Y coordinate axis.

25. The system of claim 21, wherein while determining the relevant interval for the data point, the display mechanism is configured to perform a binary search through an array containing the intersection points on the reference line.

26. The system of claim 21, wherein while keeping track of the open line segments that project onto the intervals, the display mechanism is configured to maintain a list of open line segments for every nth interval on the reference line.

27. The system of claim 21,

wherein while keeping track of the open line segments that project onto the intervals, the display mechanism is configured to maintain a list of open line segments for every nth interval on the reference line;

and

wherein while identifying a relevant interval for a data point, the display mechanism is configured to,

obtain a list of open intervals for a nearest nth interval on the reference line, and

adjust the list to account for intervening line segment openings and closings associated with intersection points located between the nearest nth interval and the relevant interval on the reference line to produce a list of open intervals for the relevant interval.

28. The system of claim 21,

wherein prior to performing the CN operation for each data point, the display mechanism is configured to sort the set of data points based on an ordering of projections of the set of data points on the reference line;

and

wherein the display mechanism is configured to process the set of data points in the sorted order to facilitate reducing an average amount of time required to identify a relevant interval for each data point.

29. The system of claim 21, wherein prior to processing the set of data points, the system is further configured to:

receive a query to be processed, wherein the query is associated with the set of geographic regions; and

use a late-binding schema generated from the query to retrieve the set of data points from a set of events containing previously gathered data.

30. The system of claim 21, wherein while obtaining the set of polygons, the system is configured to retrieve the set of polygons from a geographic database.