초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask patte...

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)