Practical encodings of graphs with highly functional query supports

设计了图形的编码算法。重点研究了平面三角剖分和网格矩形绘制，并开发了相应的编码算法。该算法能够以紧凑的空间对平面三角剖分进行编码，并支持以下查询：(1)邻接，(2)度，(3)顺时针邻域查询。在平面图的算法中，顺时针邻域查询是经常使用的。因此，这是一个非常实用的问题。我们还开发了一种对空间紧凑的网格矩形图形进行编码的算法。

We designed encoding algorithms of graphs. We mainly focuses on plane triangulations and grid rectangular drawing, and developed encoding algorithms of them. The algorithm can encode a plane triangulation with compact space and supports the following queries : (1) adjacency, (2) degree, and (3) clockwise neighbour query. The clockwise neighbor query is frequently used in algorithms for plane graphs. Hence it is an extremely practical query. We also developed an algorithm which encodes a grid rectangular drawing with compact space.