Clipping polygons to fit within a clip region

    公开(公告)号:US10748330B2

    公开(公告)日:2020-08-18

    申请号:US16256783

    申请日:2019-01-24

    Applicant: SPLUNK INC.

    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.

    USING RAY INTERSECTION LISTS TO VISUALIZE DATA POINTS BOUNDED BY GEOMETRIC REGIONS

    公开(公告)号:US20190391990A1

    公开(公告)日:2019-12-26

    申请号:US16560001

    申请日:2019-09-04

    Applicant: SPLUNK INC.

    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.

    Efficient point-in-polygon indexing technique to visualize data points bounded by geometric regions

    公开(公告)号:US10467263B2

    公开(公告)日:2019-11-05

    申请号:US15665247

    申请日:2017-07-31

    Applicant: SPLUNK, Inc.

    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.

    CLIPPING POLYGONS USING A STORAGE GRID
    4.
    发明申请

    公开(公告)号:US20190213782A1

    公开(公告)日:2019-07-11

    申请号:US16256783

    申请日:2019-01-24

    Applicant: SPLUNK INC.

    CPC classification number: G06T15/30

    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.

    Efficient point-in-polygon indexing technique for processing queries over geographic data sets

    公开(公告)号:US10026204B2

    公开(公告)日:2018-07-17

    申请号:US14606396

    申请日:2015-01-27

    Applicant: Splunk Inc.

    Abstract: A system that displays geographic data is disclosed. During operation, the system receives a query to be processed, wherein the query is associated with a set of geographic regions. Next, the system uses a late-binding schema generated from the query to retrieve a set of data points from a set of events containing previously gathered data. Then, for each data point in a set of data points, the system identifies zero or more geographic regions in the set of geographic regions that the data point falls into. Finally, the system displays 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.

    Three-dimensional point-in-polygon operation to facilitate displaying three-dimensional structures

    公开(公告)号:US09842432B2

    公开(公告)日:2017-12-12

    申请号:US15421290

    申请日:2017-01-31

    Applicant: SPLUNK INC.

    Abstract: A system, a method and instructions embodied on a non-transitory computer-readable storage medium that solve a 3D point-in-polygon (PIP) problem is presented. This system projects polygons that comprise a set of polyhedra onto projected polygons in a reference plane. Next, the system projects a data point onto the reference plane, and performs a 2D PIP operation in the reference plane to determine which projected polygons the projected data point falls into. For each projected polygon the projected data point falls into, the system performs a 3D crossing number operation by counting intersections between a ray projected from the corresponding data point in a direction orthogonal to the reference plane and polyhedral faces corresponding to projected polygons, to identify polyhedra the data point falls into. The system then generates a visual representation of the set of polyhedra, wherein each polyhedron is affected by data points that fall into it.

    EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE FOR PROCESSING QUERIES OVER GEOGRAPHIC DATA SETS
    7.
    发明申请
    EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE FOR PROCESSING QUERIES OVER GEOGRAPHIC DATA SETS 有权
    用于在地理数据集中处理查询的有效点聚合索引技术

    公开(公告)号:US20160217597A1

    公开(公告)日:2016-07-28

    申请号:US14606396

    申请日:2015-01-27

    Applicant: Splunk Inc.

    CPC classification number: G06T11/20 G06F17/30241 G06T1/20 G06T1/60

    Abstract: A system that displays geographic data is disclosed. During operation, the system receives a query to be processed, wherein the query is associated with a set of geographic regions. Next, the system uses a late-binding schema generated from the query to retrieve a set of data points from a set of events containing previously gathered data. Then, for each data point in a set of data points, the system identifies zero or more geographic regions in the set of geographic regions that the data point falls into. Finally, the system displays 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.

    Abstract translation: 公开了显示地理数据的系统。 在操作期间,系统接收要处理的查询,其中查询与一组地理区域相关联。 接下来,系统使用从查询生成的后期绑定模式,从包含先前收集的数据的一组事件中检索一组数据点。 然后,对于一组数据点中的每个数据点,系统识别数据点落入的地理区域集合中的零个或多个地理区域。 最后,系统显示一组地理区域,其中定义地理区域的每个多边形被标记以指示落入多边形的数据点的数量。

    THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE VISUALIZING 3D LOCATIONS ENCLOSED BY 3D GEOMETRIC REGIONS

    公开(公告)号:US20180322697A1

    公开(公告)日:2018-11-08

    申请号:US16037434

    申请日:2018-07-17

    Applicant: Splunk Inc.

    Abstract: A system, a method and instructions embodied on a non-transitory computer-readable storage medium that solve a 3D point-in-polygon (PIP) problem is presented. This system projects polygons that comprise a set of polyhedra onto projected polygons in a reference plane. Next, the system projects a data point onto the reference plane, and performs a 2D PIP operation in the reference plane to determine which projected polygons the projected data point falls into. For each projected polygon the projected data point falls into, the system performs a 3D crossing number operation by counting intersections between a ray projected from the corresponding data point in a direction orthogonal to the reference plane and polyhedral faces corresponding to projected polygons, to identify polyhedra the data point falls into. The system then generates a visual representation of the set of polyhedra, wherein each polyhedron is affected by data points that fall into it.

    Efficient point-in-polygon indexing technique for facilitating geofencing operations

    公开(公告)号:US09916326B2

    公开(公告)日:2018-03-13

    申请号:US14606407

    申请日:2015-01-27

    Applicant: Splunk Inc.

    CPC classification number: G06F17/30241 G06F17/30958 H04W4/021

    Abstract: A system that facilitates a geofencing operation 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 performs a geofencing operation for the location-aware device based on the identified polygons that the data point falls into.

    EFFICIENT POLYGON-CLIPPING TECHNIQUE TO REDUCE DATA TRANSFER REQUIREMENTS FOR A VIEWPORT
    10.
    发明申请
    EFFICIENT POLYGON-CLIPPING TECHNIQUE TO REDUCE DATA TRANSFER REQUIREMENTS FOR A VIEWPORT 有权
    有效的多边形剪辑技术可降低视图的数据传输要求

    公开(公告)号:US20160217607A1

    公开(公告)日:2016-07-28

    申请号:US14815022

    申请日:2015-07-31

    Applicant: Splunk Inc.

    CPC classification number: G06T15/30

    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.

    Abstract translation: 描述显示一组多边形的系统。 该系统获得一组定义多边形集合的线段。 该系统形成水平索引,跟踪线段垂直投影到水平参考线上的位置,并且类似地形成垂直参考线上的水平投影的垂直索引。 系统获取将视图定义到多边形集合中的剪辑矩形,并使用水平和垂直索引来确定剪辑矩形的边框与线段集合中的线段之间的交集。 接下来,系统使用确定的交集来剪切与剪辑矩形相交的多边形集合中的多边形。 最后,系统将剪切的多边形以及完全适合剪辑矩形的未剪裁的多边形传送到将视图显示到多边形集合中的显示设备。

Patent Agency Ranking