一个新的多边形方案

A NEW POLYGON PROJECT

本文介绍了基于超图拓扑逻辑结构和关系数据库“物理”结构的多边形方案。其中的多边形结构为树状，各多边形都具有各自的等级和便于继续生长的动态特性，如同实际的地域划分。并赋与节点匹配新的含义，简化了数据输入过程，使之工作量大大减少，通过检索“父系多边形”进行多边形检索具有严密、迅速的特点。

This paper introduces a new polygon project based on the HYPER GRAPH logi- cal structure and on the relational data base 'physical structure' in which the structure of the polygons located on a plane layer is tree construction. they have their own class and dynamic character that permit the tree continuously to grow. which is similar to dividing area in reality. Based on the above the node match is given a new sense and the definition of the corresponding process of the data input and the search is also given. The process of data input is simplified and input quantity is greatly decreased. the sear- ch of a polygon can be made by selecting the 'father's series polygons'.