Extending ML-OARSMT to Net Open Locator with Efficient and Effective Boolean Operations
碩士 === 國立交通大學 === 電子研究所 === 107 === Multi-layer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) problem has been extensively studied in recent years. In this work, we consider a variant of ML- OARSMT problem and extend the applicability to the net open location finder. Since ECO or ro...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/rhdfyn |