Skip to main content
SpringerLink
Log in

Algorithms for corner stitched data-structures

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Corner Stitching was first presented by Ousterhout as a data-structure for VLSI CAD. This paper describes the data-structure in detail. It presents, in greater depth than previously, algorithms for the basic operations described in Ousterhout's original paper. The algorithms for enumerating and updating arbitrary rectangular areas are new. Their constant space complexity bounds are an improvement over previous algorithms for those operations that were recursive. From a practical standpoint, the elimination of the recursion has also made them much faster.

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. J. K. Ousterhout, Corner stitching: A data-structuring technique for VLSI layout tools,IEEE Trans. CAD/ICAS,CAD-3, 1 (January 1984), 87–99.

    Google Scholar 

  2. C. Mead and L. Conway,Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980.

    Google Scholar 

  3. J. L. Bentley and J. H. Friedman, Data structures for range searching,Comput. Surveys,11, 4 (December 1979), 397–409.

    Article  Google Scholar 

  4. G. Kedem, The Quad-CIF tree: A data structure for hierarchical on-line algorithms,Proceedings of 19th Design Automation Conference, June 1982, pp. 352–357.

  5. B. J. Nelson and M. A. Shand, An integrated, technology independent, high performance artwork analyzer for VLSI circuit design,J. VLSI Computer Systems,1, 3 (1985), 271–295.

    Google Scholar 

  6. D. G. Fairbairn and J. H. Rowson, ICARUS: An interactive integrated circuit layout program,Proceedings of 15th Design Automation Conference, June 1978, pp. 188–192.

  7. K. H. Keller and A. R. Newton, KIC2: A low-cost, interactive editor for integrated circuit design,Proceedings of Spring COMPCON, 1982, pp. 305–306.

  8. J. K. Ousterhout, The user interface and implementation of an IC layout editor,IEEE Trans. CAD/ICAS,CAD-3, 3 (July 1984), 242–249.

    Google Scholar 

  9. J. K. Ousterhout, G. T. Hamachi, R. N. Mayo, W. S. Scott, and G. S. Taylor, Magic: A VLSI layout system,Proceedings of 21st Design Automation Conference, June 1984, pp. 152–159.

  10. M. A. Shand, Hierarchical VLSI artwork analysis, inVLSI 85, Proceeding of the IFIP TC10/WG10.5 International Conference on VLSI (E. Horbst, ed.), North-Holland, Amsterdam, 1985.

    Google Scholar 

  11. L. J. Guibas and F. F. Yao, On translating a set of rectangles,Proceedings of 12th Symposium on Theory of Computing, April 1980, pp. 154–160.

  12. D. E. Knuth,The Art of Computer Programming, Volume 1—Fundamental Algorithms, 2nd edn., Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basser Department of Computer Science, The University of Sydney, 2006, Sydney, New South Wales, Australia

    Mark A. Shand

Authors
  1. Mark A. Shand
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Mark R. Brown.

This research was supported by the Australian Government Postgraduate Research Awards Scheme and Xerox Corporation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shand, M.A. Algorithms for corner stitched data-structures. Algorithmica 2, 61–80 (1987). https://doi.org/10.1007/BF01840349

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01840349

Key words

Search

Navigation