Data Structures for Extension Violations in a Query Range

  • Ananda Swarup Das
  • Prosenjit Gupta
  • Kannan Srinathan
Article
First Online:
Received:
Accepted:

Abstract

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.

Keywords

VLSI design rule checking Range-aggregate queries Range searching 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11, 116–132 (1994)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 23, pp. 1–56. American Mathematical Society Press (1999)Google Scholar
  3. 3.
    Janardan, R., Gupta, P., Kumar, Y., Smid, M.H.: Data structures for range aggregate extent queries. In: Proceedings 20th Canadian Conference on Computational Geometry, pp. 7–10 (2008)Google Scholar
  4. 4.
    Gupta, P.: Algorithms for range-aggregate query problems involving geometric aggregation operations. In: Proceedings, International Symposium on Algorithms and Computation. LNCS, vol. 3827, pp. 892–901. Springer, Verlag (2005)Google Scholar
  5. 5.
    Szymanski, T.G., van Wyk, C.J.: Layout analysis and verification. In: Preas, B., Lorenzetti, M. (eds.) Physical Design Automation of VLSI Systems, pp. 347–407. Benjamin, Cummins (1988)Google Scholar
  6. 6.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Verlag (2000)Google Scholar
  7. 7.
    McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Das, A.S., Gupta, P., Srinathan, K.: Data structures for reporting extension violations in a query range. In: Proceedings, 21st Canadian Conference on Computational Geometry (CCCG), pp. 129–132 (2009)Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Ananda Swarup Das
    • 1
  • Prosenjit Gupta
    • 2
  • Kannan Srinathan
    • 1
  1. 1.Center for Security, Theory and Algorithmic ResearchInternational Institute of Information TechnologyHyderabadIndia
  2. 2.Yahoo! Research and DevelopmentBangaloreIndia

Personalised recommendations