ADJACENT RELATION REARRANGEMENT METHOD AND DEVICE AND STORAGE MEDIUM STORED WITH ADJACENT RELATION REARRANGEMENT PROGRAM

摘要

PROBLEM TO BE SOLVED: To retrieve an area that is adjacent to the graphic name of an attentional area and also to display the retrieved area in an easy-to-read way by rearranging the graphic names of areas which are included in a drawing. ;SOLUTION: The coordinates of an area name is acquired that is selected as the center of rearrangement based on an area information table which includes the area graphic names, the key point coordinates of area graphic and the area graphic information and also on an adjacent relation network table which includes the areas existing which interposing each boundary line. Then the acquired coordinates are stored in a sorted list, and the area name that is just adjacent to the one stored in the sorted list is extracted from the adjacent relation network table. The extracted area is sorted, based on the area information table, divided into an upper or left part and a lower or right part of the sort center coordinates and stored in the sorted list with the sorted list held between those divided parts. The sorting operations are repeated from the reading of the adjacent relation until all area names are sorted.;COPYRIGHT: (C)2000,JPO