Incremental node extraction algorithms for incremental layout system
Myong Heon Cynn, S.-M. Kang · 2002
In this paper, we propose incremental node extraction algorithms for incremental layout system. The algorithms are based on corner stitching data structure. The algorithm for insertion visits each connected tile the recursively with depth-first search while the algorithm for deletion uses the expanded area enumeration. To warrant the local searching space for the incremental constraint generation, planes are generated from the given design rules and used for incremental node extraction.