×

Routing graphs for buildings

  • US 9,116,003 B2
  • Filed: 09/03/2010
  • Issued: 08/25/2015
  • Est. Priority Date: 10/01/2009
  • Status: Expired due to Fees
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.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×