论文信息 - Data Structures for Extension Violations in a Query Range

Data Structures for Extension Violations in a Query Range

Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules and reporting the violations if any. We propose data structures for reporting violations of the minimum extension rule in a query window of interest.

K. Srinathan | Ananda Swarup Das | Prosenjit Gupta

[1] Prosenjit Gupta. Range-Aggregate Query Problems Involving Geometric Aggregation Operations , 2006, Nord. J. Comput..

[2] R. Pollack,et al. Advances in Discrete and Computational Geometry , 1999 .

[3] K. Srinathan,et al. Data Structures for Reporting Extension Violations in a Query Range , 2009, CCCG.

[4] Edward M. McCreight,et al. Priority Search Trees , 1985, SIAM J. Comput..

[5] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[6] Leonidas J. Guibas,et al. Algorithms for bichromatic line-segment problems and polyhedral terrains , 1994, Algorithmica.

[7] Pankaj K. Agarwal,et al. Geometric Range Searching and Its Relatives , 2007 .