Routing graphs for buildings
First Claim
Patent Images
1. A method being executed by a special purpose computing device comprising:
- receiving, by the special purpose computing device, building information descriptive of at least a portion of a building structure and of doors of the building structure;
superimposing, by the special purpose computing device, a grid of points onto said building information, the grid of points comprising a set of points located at regular intervals in a plane;
modeling the doors of the building structure in a closed state;
determining a plurality of autonomous areas based on the superimposed grid of points wherein each autonomous area comprises a set of adjacent grid points interconnected by traversable links that is separated from any other autonomous area by non-traversable links; and
interconnecting in the plane, by the special purpose computing device, at least a portion of a plurality of door node points with at least a portion of the plurality of autonomous areas to create at least one routing graph wherein the plurality of door node points correspond to the doors of the building structure and further wherein the at least one routing graph is a routing topology indicating a set of discrete traversable paths interconnecting the plurality of autonomous areas.
1 Assignment
0 Petitions
Accused Products
Abstract
The subject matter disclosed herein relates to systems, methods, etc. for creating a routing graph based at least partly on building information. For certain example implementations, a method includes obtaining building information descriptive of at least a portion of a building structure. A grid of points may be superimposed onto the building information. At least one routing graph may be created based at least in part on the superimposed grid of points and the building information. Other example implementations are also described.
117 Citations
25 Claims
-
1. A method being executed by a special purpose computing device comprising:
-
receiving, by the special purpose computing device, building information descriptive of at least a portion of a building structure and of doors of the building structure; superimposing, by the special purpose computing device, a grid of points onto said building information, the grid of points comprising a set of points located at regular intervals in a plane; modeling the doors of the building structure in a closed state; determining a plurality of autonomous areas based on the superimposed grid of points wherein each autonomous area comprises a set of adjacent grid points interconnected by traversable links that is separated from any other autonomous area by non-traversable links; and interconnecting in the plane, by the special purpose computing device, at least a portion of a plurality of door node points with at least a portion of the plurality of autonomous areas to create at least one routing graph wherein the plurality of door node points correspond to the doors of the building structure and further wherein the at least one routing graph is a routing topology indicating a set of discrete traversable paths interconnecting the plurality of autonomous areas. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A special purpose computing device comprising:
-
at least one memory to store instructions; and one or more processors to execute said instructions to; receive building information descriptive of at least a portion of a building structure and of doors of the building structure, superimpose a grid of points onto said building information, the grid of points comprising a set of points located at regular intervals in a plane; model the doors of the building structure in a closed state; determine a plurality of autonomous areas based on the superimposed grid of points wherein each autonomous area comprises a set of adjacent grid points interconnected by traversable links that is separated from any other autonomous area by non-traversable links; and interconnect in the plane at least a portion of a plurality of door node points with at least a portion of the plurality of autonomous areas to create at least one routing graph wherein the plurality of door node points correspond to the doors of the building structure and further wherein the at least one routing graph is a routing topology indicating a set of discrete traversable paths interconnecting the plurality of autonomous areas. - View Dependent Claims (12, 13, 14, 15)
-
-
16. An article comprising:
- at least one non-transitory storage medium having stored thereon instructions executable by one or more processors to;
receive building information descriptive of at least a portion of a building structure and of doors of the building structure, superimpose a grid of points onto said building structure information, the grid of points comprising a set of points located at regular intervals in a plane; model the doors of the building structure in a closed state; determine a plurality of autonomous areas based on the superimposed grid of points wherein each autonomous area comprises a set of adjacent grid points interconnected by traversable links that is separated from any other autonomous area by non-traversable links; and interconnect in the plane at least a portion of a plurality of door node points with at least a portion of the plurality of autonomous areas to create at least one routing graph based at least in part on said superimposed grid of points wherein the plurality of door node points correspond to the doors of the building structure and further wherein the at least one routing graph is a routing topology indicating a set of discrete traversable paths interconnecting the plurality of autonomous areas. - View Dependent Claims (17, 18, 19, 20)
- at least one non-transitory storage medium having stored thereon instructions executable by one or more processors to;
-
21. An apparatus comprising:
-
means for receiving building information descriptive of at least a portion of a building structure and of doors of the building structure, means for superimposing a grid of points onto said building information, the grid of points comprising a set of points located at regular intervals in a plane; means for modeling the doors of the building structure in a closed state; means for determining a plurality of autonomous areas based on the superimposed grid of points wherein each autonomous area comprises a set of adjacent grid points interconnected by traversable links that is separated from any other autonomous area by non-traversable links; and means for interconnecting in the plane at least a portion of a plurality of door node points with at least a portion of the plurality of autonomous areas to create at least one routing graph wherein the plurality of door node points correspond to the doors of the building structure and further wherein the at least one routing graph is a routing topology indicating a set of discrete traversable paths interconnecting the plurality of autonomous areas. - View Dependent Claims (22, 23, 24, 25)
-
Specification