Table 1.
Pattern | Restrictions | Algorithm | UV exposure |
---|---|---|---|
Connected | Eulerian connectivity | Build a doubly-connected edge list (De Berg et al. 2008) and create an Eulerian circuit with Fleury’s algorithm (Fleury 1883) | ET for one exposure |
Disconnected | Isolated points | Modification of a TSP approximating path | for n exposures |
Composite | None known | Handle the disconnected components first and then expose connected components afterwards | ET for one exposure along connected components for two exposures at disconnected locations |
ET is the exposure threshold that induces feature creation in the photoresist (75 mJ/cm2 ) and δ is an arbitrarily small positive value (e.g. 0.01–0.10) to ensure that exposure saturation is achieved