第十章基于空间目标排序的索引方法资料.pptxVIP

;;关键问题;;;Z-排序值;;;;;实现方法;;;enum { UP, LEFT, DOWN, RIGHT, }; void hilbert(int level,int direction=UP) { if (level==1) { switch (direction) { case LEFT: move(RIGHT); /* move() could draw a line in... */ move(DOWN); /* ...the indicated direction */ move(LEFT); break; case RIGHT: move(LEFT); move(UP); move(RIGHT); break; case UP: move(DOWN); move(RIGHT); move(UP); break; case DOWN: move(UP); move(LEFT); move(DOWN); break; } /* switch */ };;分配策略;;;;展望;;致谢