Efficient polygon-clipping technique to reduce data transfer requirements for a viewport

• US 9,836,874 B2
• Filed: 07/31/2015
• Issued: 12/05/2017
• Est. Priority Date: 01/27/2015
• Status: Active Grant

• Current Assignee: Splunk Inc.
• Original Assignee: Splunk Inc.
• Inventors: Hendrey, Geoffrey R.
• Primary Examiner(s): Mushambo, Martin
• Application Number:
  US14/815,022
• Publication Number:
  US 20160217607A1
• Time in Patent Office: 858 Days
• Field of Search: None
• CPC Class Codes: G06T 15/30 Clipping

Abstract

A system that displays a set of polygons is described. This system obtains a set of line segments that defines the set of polygons. The system forms a horizontal index that keeps track of where line segments vertically project onto a horizontal reference line and similarly forms a vertical index for horizontal projections onto a vertical reference line. The system obtains a clip rectangle that defines a view into the set of polygons and uses the horizontal and vertical indexes to determine intersections between borders of the clip rectangle and line segments in the set of line segments. Next, the system uses the determined intersections to clip polygons in the set of polygons that intersect the clip rectangle. Finally, the system transfers the clipped polygons, and also unclipped polygons that fit completely within the clip rectangle, to a display device that displays the view into the set of polygons.

Claims

1. A computer-implemented method for displaying a set of polygons,

comprising:

obtaining a clip rectangle that defines a view into the set of polygons, wherein the set of polygons is defined by a set of line segments;

using a horizontal index to determine intersections between vertical borders of the clip rectangle and line segments in the set of line segments;

using a vertical index to determine intersections between horizontal borders of the clip rectangle and line segments in the set of line segments;

using the determined intersections to clip polygons in the set of polygons that intersect the clip rectangle to form clipped polygons that fit within the clip rectangle; and

transferring the clipped polygons and also unclipped polygons that fit completely within the clip rectangle to a device to be presented to a user as the view into the set of polygons.

2. The computer-implemented method of claim 1, wherein prior to obtaining the clip rectangle, the method further comprises:

obtaining the set of line segments that defines the set of polygons;

forming the horizontal index, wherein the horizontal index keeps track of where line segments in the set of line segments vertically project onto a horizontal reference line; and

forming the vertical index, wherein the vertical index keeps track of where line segments in the set of line segments horizontally project onto a vertical reference line.

3. The computer-implemented method of claim 2, wherein forming the horizontal index comprises:

projecting rays vertically from endpoints of line segments in the set of line segments onto the horizontal reference line to form intersections with the horizontal reference line; and

for each interval between consecutive intersections on the horizontal reference line, keeping track of open line segments that project onto the interval.

4. The computer-implemented method of claim 2, wherein forming the vertical index comprises:

projecting rays horizontally from endpoints of line segments in the set of line segments onto the vertical reference line to form intersections with the vertical reference line; and

for each interval between consecutive intersections on the vertical reference line, keeping track of open line segments that project onto the interval.

5. The computer-implemented method of claim 1, wherein the method further comprises:

obtaining a new clip rectangle from a user that defines a new view into the set of polygons;

using the horizontal index to determine intersections between vertical borders of the new clip rectangle and line segments in the set of line segments;

using the vertical index to determine new intersections between horizontal borders of the new clip rectangle and line segments in the set of line segments;

using the new intersections to clip polygons in the set of polygons that intersect the new clip rectangle; and

transferring the new clipped polygons and unclipped polygons that fit completely within the new clip rectangle to a display device that displays the new view into the set of polygons.

6. The computer-implemented method of claim 1, wherein the method further comprises:

maintaining a storage grid to keep track of the set of line segments with respect to a tiled grid, wherein the tiled grid divides a region occupied by the set of polygons into a set of tiles and wherein each entry in the storage grid identifies line segments with endpoints that fall within a corresponding tile in the tiled grid;

and

wherein prior to determining the intersections using the horizontal and vertical indexes, the method further comprises winnowing the set of line segments by;

identifying tiles in the set of tiles that intersect with or are contained within the clip rectangle,

looking up the identified tiles in the storage grid to identify line segments having endpoints that fall within the identified tiles, and

redefining the set of line segments to comprise the identified line segments.

7. The computer-implemented method of claim 1, wherein while using the determined intersections to clip the polygons, the method comprises, for each polygon in a set of polygons intersected by the clip rectangle:

maintaining a polygon list including vertices of the polygon;

maintaining a clip rectangle list including vertices of the clip rectangle;

inserting polygon-specific intersections between the polygon and the clip rectangle that are obtained from the determined intersections into both the polygon list and the clip rectangle list and maintaining a bidirectional neighbor link between each instance of an intersection in the polygon list and a corresponding instance of the same intersection in the clip rectangle list;

sorting the intersections and the vertices in the polygon list in either clockwise or counter-clockwise order;

sorting the intersections and the vertices in the clip rectangle list in either clockwise or counter-clockwise order;

marking each intersection as an entry or an exit from the polygon by using a point-in-polygon test to determine whether an initial vertex in the clip rectangle list is inside or outside the clip rectangle, and while traversing the clip rectangle list, marking intersections alternately as an entry or an exit; and

generating one or more clipped polygons by emitting vertices starting at an intersection in the polygon list and navigating back and forth between the polygon list and the clip rectangle list as intersections are encountered and proceeding backward or forward in the polygon list or the clip rectangle list based upon whether the intersection is an entry or an exit.

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

9. The computer-implemented method of claim 1, wherein the method further comprises:

obtaining data associated with the set of polygons from a set of events containing raw data associated with a time stamp; and

transferring the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.

10. The computer-implemented method of claim 1, wherein the method further comprises:

receiving a query to be processed;

using a data-retrieval specification generated from the query to obtain data associated with the set of polygons from a set of events containing raw data associated with a time stamp; and

transferring the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.

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 a set of polygons, the method comprising:

obtaining a clip rectangle that defines a view into the set of polygons, wherein the set of polygons is defined by a set of line segments;

using a horizontal index to determine intersections between vertical borders of the clip rectangle and line segments in the set of line segments;

using a vertical index to determine intersections between horizontal borders of the clip rectangle and line segments in the set of line segments;

using the determined intersections to clip polygons in the set of polygons that intersect the clip rectangle to form clipped polygons that fit within the clip rectangle; and

transferring the clipped polygons, and also unclipped polygons that fit completely within the clip rectangle, to a device to be presented to a user as the view into the set of polygons.

12. The non-transitory computer-readable storage medium of claim 11, wherein prior to obtaining the clip rectangle, the method further comprises:

obtaining the set of line segments that defines the set of polygons;

forming the horizontal index, wherein the horizontal index keeps track of where line segments in the set of line segments vertically project onto a horizontal reference line; and

forming the vertical index, wherein the vertical index keeps track of where line segments in the set of line segments horizontally project onto a vertical reference line.

13. The non-transitory computer-readable storage medium of claim 12, wherein forming the horizontal index comprises:

projecting rays vertically from endpoints of line segments in the set of line segments onto the horizontal reference line to form intersections with the horizontal reference line; and

for each interval between consecutive intersections on the horizontal reference line, keeping track of open line segments that project onto the interval.

14. The non-transitory computer-readable storage medium of claim 12, wherein forming the vertical index comprises:

projecting rays horizontally from endpoints of line segments in the set of line segments onto the vertical reference line to form intersections with the vertical reference line; and

for each interval between consecutive intersections on the vertical reference line, keeping track of open line segments that project onto the interval.

15. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises:

obtaining a new clip rectangle from a user that defines a new view into the set of polygons;

using the horizontal index to determine intersections between vertical borders of the new clip rectangle and line segments in the set of line segments;

using the vertical index to determine new intersections between horizontal borders of the new clip rectangle and line segments in the set of line segments;

using the new intersections to clip polygons in the set of polygons that intersect the new clip rectangle; and

transferring the new clipped polygons, and also unclipped polygons that fit completely within the new clip rectangle, to a display device that displays the new view into the set of polygons.

16. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises:

maintaining a storage grid to keep track of the set of line segments with respect to a tiled grid, wherein the tiled grid divides a region occupied by the set of polygons into a set of tiles, and wherein each entry in the storage grid identifies line segments with endpoints that fall within a corresponding tile in the tiled grid;

and

wherein prior to determining the intersections using the horizontal and vertical indexes, the method further comprises winnowing the set of line segments by;

identifying tiles in the set of tiles that intersect with or are contained within the clip rectangle;

looking up the identified tiles in the storage grid to identify line segments having endpoints that fall within the identified tiles; and

redefining the set of line segments to comprise the identified line segments.

17. The non-transitory computer-readable storage medium of claim 11, wherein while using the determined intersections to clip the polygons, the method comprises for each polygon in a set of polygons intersected by the clip rectangle:

maintaining a polygon list including vertices of the polygon;

maintaining a clip rectangle list including vertices of the clip rectangle;

inserting polygon-specific intersections between the polygon and the clip rectangle, obtained from the determined intersections, into both the polygon list and the clip rectangle list and maintaining a bidirectional neighbor link between each instance of an intersection in the polygon list and a corresponding instance of the same intersection in the clip rectangle list;

sorting the intersections and the vertices in the polygon list in either clockwise or counter-clockwise order;

sorting the intersections and the vertices in the clip rectangle list in either clockwise or counter-clockwise order;

marking each intersection as an entry or an exit from the polygon by using a point-in-polygon test to determine whether an initial vertex in the clip rectangle list is inside or outside the clip rectangle, and while traversing the clip rectangle list, marking intersections alternately as an entry or an exit; and

generating one or more clipped polygons by emitting vertices starting at an intersection in the polygon list and navigating back and forth between the polygon list and the clip rectangle list as intersections are encountered and proceeding backward or forward in the polygon list or the clip rectangle list based upon whether the intersection is an entry or an exit.

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

19. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises:

obtaining data associated with the set of polygons from a set of time-stamped events containing raw data; and

transferring the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.

20. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises:

receiving a query to be processed;

using a data-retrieval specification generated from the query to obtain data associated with the set of polygons from a set of events containing raw data associated with a time stamp; and

transferring the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.

21. A system that displays a set of polygons, comprising:

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

a display mechanism that executes on the at least one processor, wherein during operation, the display mechanism;

obtains a clip rectangle that defines a view into the set of polygons, wherein the set of polygons is defined by a set of line segments;

uses a horizontal index to determine intersections between vertical borders of the clip rectangle and line segments in the set of line segments;

uses a vertical index to determine intersections between horizontal borders of the clip rectangle and line segments in the set of line segments;

uses the determined intersections to clip polygons in the set of polygons that intersect the clip rectangle to form clipped polygons that fit within the clip rectangle; and

transfers the clipped polygons, and also unclipped polygons that fit completely within the clip rectangle, to a device to be presented to a user as the view into the set of polygons.

22. The system of claim 21, wherein prior to obtaining the clip rectangle, the display mechanism:

obtains the set of line segments that defines the set of polygons;

forms the horizontal index, wherein the horizontal index keeps track of where line segments in the set of line segments vertically project onto a horizontal reference line; and

forms the vertical index, wherein the vertical index keeps track of where line segments in the set of line segments horizontally project onto a vertical reference line.

23. The system of claim 22, wherein while forming the horizontal index, the display mechanism:

projects rays vertically from endpoints of line segments in the set of line segments onto the horizontal reference line to form intersections with the horizontal reference line; and

for each interval between consecutive intersections on the horizontal reference line, keeps track of open line segments that project onto the interval.

24. The system of claim 22, wherein while forming the vertical index, the display mechanism:

projects rays horizontally from endpoints of line segments in the set of line segments onto the vertical reference line to form intersections with the vertical reference line; and

for each interval between consecutive intersections on the vertical reference line, keeps track of open line segments that project onto the interval.

25. The system of claim 21, wherein the display mechanism also:

obtains a new clip rectangle from a user that defines a new view into the set of polygons;

uses the horizontal index to determine intersections between vertical borders of the new clip rectangle and line segments in the set of line segments;

uses the vertical index to determine new intersections between horizontal borders of the new clip rectangle and line segments in the set of line segments;

uses the new intersections to clip polygons in the set of polygons that intersect the new clip rectangle; and

transfers the new clipped polygons, and also unclipped polygons that fit completely within the new clip rectangle, to a display device that displays the new view into the set of polygons.

26. The system of claim 21, wherein the display mechanism:

maintains a storage grid to keep track of the set of line segments with respect to a tiled grid, wherein the tiled grid divides a region occupied by the set of polygons into a set of tiles, and wherein each entry in the storage grid identifies line segments with endpoints that fall within a corresponding tile in the tiled grid;

and

wherein prior to determining the intersections using the horizontal and vertical indexes, the display mechanism winnows the set of line segments by;

identifying tiles in the set of tiles that intersect with or are contained within the clip rectangle;

looking up the identified tiles in the storage grid to identify line segments having endpoints that fall within the identified tiles; and

redefining the set of line segments to comprise the identified line segments.

27. The system of claim 21, wherein while using the determined intersections to clip the polygons, the display mechanism does the following for each polygon in a set of polygons intersected by the clip rectangle:

maintains a polygon list including vertices of the polygon;

maintains a clip rectangle list including vertices of the clip rectangle;

inserts polygon-specific intersections between the polygon and the clip rectangle, obtained from the determined intersections, into both the polygon list and the clip rectangle list, and maintains a bidirectional neighbor link between each instance of an intersection in the polygon list and a corresponding instance of the same intersection in the clip rectangle list;

sorts the intersections and the vertices in the polygon list in either clockwise or counter-clockwise order;

sorts the intersections and the vertices in the clip rectangle list in either clockwise or counter-clockwise order;

marks each intersection as an entry or an exit from the polygon by using a point-in-polygon test to determine whether an initial vertex in the clip rectangle list is inside or outside the clip rectangle, and while traversing the clip rectangle list, marks intersections alternately as an entry or an exit; and

generates one or more clipped polygons by emitting vertices starting at an intersection in the polygon list and navigating back and forth between the polygon list and the clip rectangle list as intersections are encountered, and proceeding backward or forward in the polygon list or the clip rectangle list based upon whether the intersection is an entry or an exit.

28. The system of claim 21, wherein the set of polygons defines regions of a choropleth map wherein each region is shaded, patterned or colored in proportion to a number of data points that fall into the region.

29. The system of claim 21, wherein the display mechanism additionally:

obtains data associated with the set of polygons from a set of events containing raw data associated with a time stamp; and

transfers the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.

30. The system of claim 21, wherein the display mechanism additionally:

receives a query to be processed;

uses a data-retrieval specification generated from the query to obtain data associated with the set of polygons from a set of events containing raw data associated with a time stamp; and

transfers the associated data to the display device, wherein the display device uses the associated data to facilitate displaying the set of polygons.