科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we present a coding scheme for plane triangulations. The coding scheme is very simple, and needs only 6n bits for each plane triangulation with n vertices. Also with additional o(n) bits it supports adjacency, degree and clockwise neighbour queries in constant time. Our scheme is based on a realizer of a plane triangulation. The best known algorithm needs only 4.35n + o(n) bits for each plane triangulation. Our algorithm is simple and needs 6n + o(n) bits for each plane triangulation.
- 出版日期2010-9-15
