Abstract: 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.

Abstract: 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 1). The points created in Step 1 are connected by lines (Step 2). Connection lines corresponding to the longest sides are repeatedly deleted from closed polygons defined by the connection lines obtained in Step 2 until no closed polygons are left (Step 3). Each vertex of the connection lines obtained in Step 3 is 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 4).

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

Abstract: 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.

Abstract: It is possible to display the state of the current route even with a large change in visual field in an easy-to-understand manner. A grouping unit (102) groups a plurality of nodes included in a route on a map into groups having no change in line-of-sight in an order of travel direction on the route. A point generation unit (103) generates, for each of the groups grouped by the route grouping unit, a plurality of points included in a route of the group so that the route is divided into smaller sections by the points from a start point of the group toward an end point of the group. A viewpoint determination unit (104) determines, for each of the plurality of points, a viewpoint in accordance with a condition of the point. A walk-through display unit (105) performs walk-through display for displaying a scenery corresponding to the determined viewpoint.

Abstract: Upper-order parameters and lower-order parameters can be optimized by performing evaluation a small number of times. An optimization apparatus 10 includes: an evaluation unit 300 that performs calculation based on evaluation data, an upper-order parameter z, and a lower-order parameter x, and outputs an evaluation value indicating an evaluation on the calculation result; an optimization unit 100 that optimizes the upper-order parameter z and the lower-order parameter x; and an output unit 400 that outputs the optimized upper-order parameter z and lower-order parameter x that are obtained by repeating processing in the evaluation unit 300 and processing in the evaluation unit 300.

Abstract: 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 1). The points created in Step 1 are connected by lines (Step 2). Connection lines corresponding to the longest sides are repeatedly deleted from closed polygons defined by the connection lines obtained in Step 2 until no closed polygons are left (Step 3). Each vertex of the connection lines obtained in Step 3 is 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 4).

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

Abstract: A parameter can be optimized with a small number of evaluations. For each of a plurality of candidate search points that are parameters used as candidates for search points which a candidate search point generation unit 120 has generated based on a plurality of parameters used for calculation, a search point determination unit 130 determines whether or not to set the candidate search point as a search point using a plurality of data points, each including a set of a parameter used for calculation by an evaluation unit 300 and an evaluation value that has been calculated by using the parameter used for calculation by the evaluation unit 300 as a search point.