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

    公开(公告)号:US09836874B2

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

    申请号: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.

    EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE TO VISUALIZE DATA POINTS BOUNDED BY GEOMETRIC REGIONS

    公开(公告)号:US20170329800A1

    公开(公告)日:2017-11-16

    申请号:US15665247

    申请日:2017-07-31

    Applicant: SPLUNK, Inc.

    CPC classification number: G06F16/29 G09G5/003 G09G5/02

    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.

    THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE DISPLAYING THREE-DIMENSIONAL STRUCTURES

    公开(公告)号:US20170140575A1

    公开(公告)日:2017-05-18

    申请号: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 FACILITATING GEOFENCING OPERATIONS
    25.
    发明申请
    EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE FOR FACILITATING GEOFENCING OPERATIONS 有权
    为促进地理环境作业提供有效的多点聚合索引技术

    公开(公告)号:US20160217152A1

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

    申请号: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.

    Abstract translation: 公开了一种便于进行地理围栏操作的系统。 系统获得定义一组地理区域的多边形。 然后,系统将定义多边形的线段的端点的光线投射到参考线上以形成交点。 对于参考线上的连续交点对之间的每个间隔,系统跟踪投影到间隔上的开放线段。 对于一组数据点中的每个数据点,系统识别数据点投影到的参考线上的相关间隔,并执行交叉数操作以识别数据点落入的多边形,并且系统递增计数 对于数据点落入的每个多边形。 最后,系统基于数据点所属的多边形对位置感知设备执行地理围栏操作。

    Clipping polygons based on a scan of a storage grid

    公开(公告)号:US11189083B2

    公开(公告)日:2021-11-30

    申请号:US16911663

    申请日:2020-06-25

    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.

    Three-dimensional point-in-polygon operation to facilitate visualizing 3D locations enclosed by 3D geometric regions

    公开(公告)号:US10235803B2

    公开(公告)日:2019-03-19

    申请号: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.

    PIP indexing technique to clip polygons in a clipping region

    公开(公告)号:US10223826B2

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

    申请号:US15799569

    申请日:2017-10-31

    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.

    SIMPLIFIED POINT-IN-POLYGON TEST FOR PROCESSING GEOGRAPHIC DATA

    公开(公告)号:US20180276857A1

    公开(公告)日:2018-09-27

    申请号:US15997401

    申请日:2018-06-04

    Applicant: Splunk Inc.

    CPC classification number: G06T11/20 G06F16/29 G06T1/20 G06T1/60 G06T11/206

    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.

    Ray Casting Technique for Geofencing Operation

    公开(公告)号:US20180150480A1

    公开(公告)日:2018-05-31

    申请号:US15879153

    申请日:2018-01-24

    Applicant: Splunk, Inc.

    CPC classification number: G06F16/29 G06F16/9024 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.

Patent Agency Ranking