Nippon Telegraph and Telephone Corporation

Kyota Tsutsumida

Mitsuru Mochizuki

Osamu Matsuda

Hitoshi Seshimo

Routes can be found while improving the convenience of guidance for users. A route-searching device includes a search-condition acquisition unit that acquires search conditions for searching a route including a starting point and a destination; a route-data storage unit that stores a link ID, the node IDs of the starting point and the end point of a link, and road network information concerning a road network and including a link length; an instruction-data storage unit that stores instruction data including a type associated with the node ID, a value for the type, and a coefficient for the value; and a route generation unit that generates route candidates including the shortest route based on the search conditions and the road network information, calculating, for each of the route candidates, an index value based on information included in the instruction data, and outputting, as a search route, the route candidate with the index value improved from the index value of the shortest route.

Route search device, route search method, and route search program

A centerline for generating network data of an indoor space can be generated while limiting the amount of calculation. Points where first straight lines and second straight lines constituting centerlines meet are created using re-entrant vertices (Step). The points created in Stepare connected by lines (Step). Connection lines corresponding to the longest sides are repeatedly deleted from closed polygons defined by the connection lines obtained in Stepuntil no closed polygons are left (Step). Each vertex of the connection lines obtained in Stepis connected to a farthest center point on the perimeter of the shape of the passage if there is such a farthest center point to which the vertex can be connected without touching the perimeter and without crossing other connection lines (Step).

Center line generation device, network data generation system and program

Centerlines for generating network data of an indoor space can be simplified while the amount of calculation is limited. A centerline simplification unitperforms processing of deleting centerlines of passages that are movable regions in an indoor space and processing of correcting centerlines. A determination unitdetermines whether or not the simplification has ended based on the number of centerlines or the number of vertices connecting the centerlines.

Growing community of inventors

Tokyo, Japan

Kyota Tsutsumida