EFFICIENT POLYGON-CLIPPING TECHNIQUE TO REDUCE DATA TRANSFER REQUIREMENTS FOR A VIEWPORT

    公开(公告)号:US20180053342A1

    公开(公告)日:2018-02-22

    申请号:US15799569

    申请日:2017-10-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.

    THREE-DIMENSIONAL POINT-IN-POLYGON OPERATION TO FACILITATE VISUALIZING DATA POINTS BOUNDED BY 3D GEOMETRIC REGIONS

    公开(公告)号:US20180012405A1

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

    申请号:US15714841

    申请日:2017-09-25

    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
    33.
    发明申请
    EFFICIENT POINT-IN-POLYGON INDEXING TECHNIQUE TO FACILITATE DISPLAYING GEOGRAPHIC DATA 有权
    有效的多点聚合索引技术来显示地理数据

    公开(公告)号:US20160217151A1

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

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

    Abstract translation: 公开了显示地理数据的系统。 系统获得定义一组地理区域的多边形。 然后,系统将定义多边形的线段的端点的光线投射到参考线上以形成交点。 对于参考线上的连续交点对之间的每个间隔,系统跟踪投影到间隔上的开放线段。 对于一组数据点中的每个数据点,系统识别数据点投影到的参考线上的相关间隔,并执行交叉数操作以识别数据点落入的多边形,并且系统递增计数 对于数据点落入的每个多边形。 最后,系统以指示落入每个地理区域的数据点的数量的方式显示该组地理区域。

Patent Agency Ranking