Area routing oriented hierarchical corner stitching with partial bin
Zhang Yan, Wang Baohua, Cai Yici, Hong Xianlong · 2002
An efficient layout data structure is of great importance to a gridless area routing algorithm. Nowadays, the rectangular corner stitching structure, whose point searching and tile insertion are O(N/sup 1/2/), is the most popular data structure used by gridless area routers. In this paper, we discuss a novel database-hierarchical corner stitching with partial bin, or hierarchical PB corner stitching, which combined the bin-based structure and trapezoidal corner stitching. Its point searching and tile insertion are both enhanced to O(N/sup 1/2//r). We also derive the algorithms of the operations, such as point searching, area searching, plowing, etc., according to the specialties of area routers.