CONSTRUCTING COMPACT THREE-DIMENSIONAL BUILDING MODELS

    公开(公告)号:US20210116568A1

    公开(公告)日:2021-04-22

    申请号:US16660260

    申请日:2019-10-22

    Abstract: An example method performed by a processing system includes obtaining a light detecting and ranging point cloud of a building, where the point cloud includes a plurality of points, and where each point is associated with a set of (x,y,z) coordinates. A first point of the plurality of points is assigned to a subset of the plurality of points that is associated with the building, where the subset includes points whose (x,y) coordinates fall within a footprint of the building. The first point is grouped into a first cluster according to at least one of: a (z) coordinate of the first point and a gradient to which the first point belongs. A first prism formed by the first cluster is constructed. A model of the building is stored as a plurality of connected prisms, where the plurality of connected prisms includes the first prism.

    Systems and methods for modeling networks

    公开(公告)号:US10530661B2

    公开(公告)日:2020-01-07

    申请号:US15198575

    申请日:2016-06-30

    Abstract: A system may include a processor, an input, and memory comprising a graph database and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations may include receiving, via the input, a query comprising pathway variables. The operations may also include determining an anchor set based on at least one of the pathway variables and identifying an evaluation order based on the anchor set. The operations may also include translating the pathway variables into a pathway algebraic expression based on the evaluation order. The operations may include executing the pathway algebraic expression on the graph database to return a pathway set.

    DATABASE EVALUATION OF ANCHORED LENGTH-LIMITED PATH EXPRESSIONS

    公开(公告)号:US20180060396A1

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

    申请号:US15253591

    申请日:2016-08-31

    CPC classification number: G06F17/30958

    Abstract: A method includes parsing a regular pathway expression into fragments including an anchored fragment and at least one other fragment. A number of the fragments is based on at least a length limitation of the regular pathway expression. The method includes generating an operator directed acyclic graph (DAG) including non-operator nodes, operator nodes, and a root based on at least the anchored fragment. The method includes removing, from the operator DAG, at least one of the non-operator nodes and connecting a first operator node to a second operator node of the operator nodes. The first operator node includes an edge into the at least one removed non-operator node, and the second operator node includes an edge from the at least one removed node. The method includes executing the operator DAG on a graph database to return a pathway set comprising at least one pathway that satisfies the regular pathway expression.

    SYSTEMS AND METHODS FOR MODELING NETWORKS
    85.
    发明申请

    公开(公告)号:US20180006898A1

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

    申请号:US15198575

    申请日:2016-06-30

    CPC classification number: H04L41/145 G06F16/9024 H04L41/142 H04W24/04

    Abstract: A system may include a processor, an input, and memory comprising a graph database and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations may include receiving, via the input, a query comprising pathway variables. The operations may also include determining an anchor set based on at least one of the pathway variables and identifying an evaluation order based on the anchor set. The operations may also include translating the pathway variables into a pathway algebraic expression based on the evaluation order. The operations may include executing the pathway algebraic expression on the graph database to return a pathway set.

Patent Agency Ranking