US 2011/0238387 A1Published application

Apparatus and computer program for generating route

OwnerToshiyuki MIYAKE, Ichiro Harashima +3inventors

InventorsToshiyuki MIYAKE, Ichiro Harashima, Koji Shiroyama, Masatake Sato, Yuhiro Yoshida

Life of this patent

Estimating the term…

Loading patent…

Abstract

A route generating apparatus includes: storage section storing geometric data of connection objects; data representing connection relations of group of main route for directly connecting objects, and branch route branching from main route, and connection objects; and data representing each constraint condition for constraining disposition position of branch point on the main route; constraint region generating section that generates each constraint region where corresponding branch point can be disposed, based on the geometric disposition position of corresponding connection object, corresponding connection relation, and corresponding constraint condition; route generating section that generates, as each main route, a shortest main route passing through each constraint region and generates, as each branch route, a shortest branch route that branches from the main route; and constraint region and route display section that displays a geometric figure of each constraint region, each main route, and each branch route.

Claims6

Dependent claims

A route generating apparatus for generating routes that connect connection objects, comprising:

a storage section that stores:
disposition data that represents geometric disposition positions of connection objects;
connection relation data that represents connection relations between each main route for directly connecting connection objects, each branch route that branches from the main route and connects with a connection object and the main route, and the connection objects;
and
design constraint data which represents each constraint condition for constraining a disposition position of a branch point where the corresponding branch route branches from the corresponding main route;
a constraint region generating section that generates constraint region data which represents, for the each branch route, a constraint region where the corresponding branch point can be disposed, based on the geometric disposition position of the corresponding connection object represented by the disposition data, the corresponding connection relation represented by the connection relation data, and the corresponding constraint condition represented by the design constraint data;
a route generating section that generates, as the each main route, a shortest main route passing through the each constraint region corresponding to the each branch route connected with the main route, and generates, as the each branch route, a shortest branch route that branches from the main route;
and
a constraint region and route display section that displays, on a display unit, a geometric figure representing the each constraint region and a geometric figure representing the each main route and the each branch route, superimposing the geometric figures or individually.

6 more elements

A program for generating routes that makes a computer for generating routes which connect connection objects function as a route generating apparatus, wherein the program makes the route generating apparatus implemented by the computer to comprise the functions of:

a storage section that stores:
disposition data that represents geometric disposition positions of connection objects;
connection relation data that represents connection relations between each main route for directly connecting connection objects, each branch route that branches from the main route and connects with a connection object and the main route, and the connection objects;
and
design constraint data which represents each constraint condition for constraining a disposition position of a branch point where the corresponding branch route branches from the corresponding main route;
a constraint region generating section that generates constraint region data which represents, for the each branch route, a constraint region where the corresponding branch point can be disposed, based on the geometric disposition position of the corresponding connection object represented by the disposition data, the corresponding connection relation represented by the connection relation data, and the corresponding constraint condition represented by the design constraint data;
a route generating section that generates, as the each main route, a shortest main route passing through the each constraint region corresponding to the each branch route connected with the main route, and generates, as the each branch route, a shortest branch route that branches from the main route;
and
a constraint region and route display section that displays, on a display unit, a geometric figure representing the each constraint region and a geometric figure representing the each main route and the each branch route, superimposing the geometric figures or individually.

6 more elements

Dependencies are inferred from the claim text.