Skip to main content

Advertisement

SpringerLink
Log in

Data Structures for Extension Violations in a Query Range

  • Published:
Journal of Mathematical Modelling and Algorithms

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11, 116–132 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  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)

  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)

  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)

  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)

  6. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Verlag (2000)

  7. McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  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)

Download references

Author information

Authors and Affiliations

  1. Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India, 500032

    Ananda Swarup Das & Kannan Srinathan

  2. Yahoo! Research and Development, Bangalore, 500071, India

    Prosenjit Gupta

Authors
  1. Ananda Swarup Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prosenjit Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kannan Srinathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ananda Swarup Das.

Additional information

A preliminary version of the paper appears as a four-page extended abstract in the Proceedings, Canadian Conference on Computational Geometry (2009) [8].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Das, A.S., Gupta, P. & Srinathan, K. Data Structures for Extension Violations in a Query Range. J Math Model Algor 10, 79–107 (2011). https://doi.org/10.1007/s10852-010-9144-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-010-9144-y

Keywords

Search

Navigation