Firstly , singly linked lists are used as the data structure of this algorithm rather than doubly linked lists or trees as other algorithms use , so less memory space and running time are required . secondly , the relationship between the entry and exit points on the two polygons is found and argumentation , which , with the reasonable operations on the lists , reduces the times that the lists are traversed and allows the polygon to be input clockwise or counterclockwise 该算法使用单线性链表数据结构,与其它使用双链表或树结构的算法相比具有占用空间少及处理速度快的特点;其次,找出并论证两个多边形之间进、出点之间的关系,并通过合理的数据结构处理,减少了算法对多边形链表的遍历次数,而且允许多边形既可以按顺时针方向也可以按逆时针方向输入。
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes.
doubly linked listとは意味:<→DOUBLY-LINKED list> doubly linked list meaning:[Computer] < programming > A data structure in which each element contains pointers to the next and previous elements in the list, thus forming a bidirectional linear list.