THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE DISPLAYING THREE-DIMENSIONAL STRUCTURES
    11.
    发明申请
    THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE DISPLAYING THREE-DIMENSIONAL STRUCTURES 有权
    三维多点聚合运算,以便于显示三维结构

    公开(公告)号:US20160217153A1

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

    申请号:US14700685

    申请日:2015-04-30

    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.

    Abstract translation: 呈现了解决3D点对多点(PIP)问题的非暂时计算机可读存储介质中体现的系统,方法和指令。 该系统将包含一组多面体的多边形投影到参考平面中的投影多边形上。 接下来,系统将数据点投影到参考平面上,并在参考平面中执行2D PIP操作,以确定投影数据点落入的投影多边形。 对于投影数据点落入的每个投影多边形,系统通过计算从与参考平面正交的方向上的相应数据点投射的射线与对应于投影多边形的多面体面之间的交点进行3D交叉数运算,以识别多面体 数据点落入。 然后,系统生成多面体集的视觉表示,其中每个多面体受落入其中的数据点的影响。

    Polygon clipping based on traversing lists of points

    公开(公告)号:US11734878B1

    公开(公告)日:2023-08-22

    申请号:US17448094

    申请日:2021-09-20

    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.

    THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE VISUALIZING A 3D STRUCTURE SURROUNDING A DATA POINT

    公开(公告)号:US20190184287A1

    公开(公告)日:2019-06-20

    申请号:US16262733

    申请日:2019-01-30

    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 to facilitate displaying geographic data

    公开(公告)号:US09767122B2

    公开(公告)日:2017-09-19

    申请号:US14606387

    申请日:2015-01-27

    Applicant: Splunk Inc.

    CPC classification number: G06F17/30241 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

    公开(公告)号:US09607414B2

    公开(公告)日:2017-03-28

    申请号:US14700685

    申请日:2015-04-30

    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.

    Using ray intersection lists to visualize data points bounded by geometric regions

    公开(公告)号:US10860624B2

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

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

    CLIPPING POLYGONS BASED ON A SCAN OF A STORAGE GRID

    公开(公告)号:US20200327725A1

    公开(公告)日:2020-10-15

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

    Ray casting technique for geofencing operation

    公开(公告)号:US10789279B2

    公开(公告)日:2020-09-29

    申请号:US15879153

    申请日:2018-01-24

    Applicant: Splunk, Inc.

    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.

    Three-dimensional point-in-polygon operation to facilitate visualizing a 3D structure surrounding a data point

    公开(公告)号:US10688394B2

    公开(公告)日:2020-06-23

    申请号:US16262733

    申请日:2019-01-30

    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.

    Simplified point-in-polygon test for processing geographic data

    公开(公告)号:US10657680B2

    公开(公告)日:2020-05-19

    申请号:US15997401

    申请日:2018-06-04

    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.

Patent Agency Ranking