Skip to main content
SpringerLink
Log in

A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

A parallel algorithm to generate the dominance graph on a collection of nonoverlapping iso-oriented rectangles is presented. This graph arises from the constraint graph commonly used in compaction algorithms for VLSI circuits. The dominance graph expresses the notion of “aboveness” on a collection of nonoverlapping rectangles: it is the directed graph which contains an edge from a rectangleb to rectanglec iffc is immediately aboveb. The algorithm is based on the divide and conquer paradigm; in the EREW PRAM model, it has time complexityO(log2 n), usingn/logn processors. Its processor-time product isO(nlogn), which is optimal.

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. D. G. Boyer, Symbolic layout compaction review.Proc. of 25th Design Automation Conf., pp. 383–389 (1988).

  2. T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner (1990).

  3. R. H. Gueting Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles,Acta Informatica,21:271–291 (1984).

    Google Scholar 

  4. M. Lu and P. Varman, Optimal algorithms for rectangle problems on a mesh-connected computer,J. Parallel Distributed Computing,5:154–171 (1988).

    Google Scholar 

  5. Q. F. Stout, Supporting divide-and-conquer algorithms for image processing,J. Parallel Distributed Computing,4:95–115 (1987).

    Google Scholar 

  6. R. H. Gueting, O. Nurmi, and T. Ottmann, Fast algorithms for direct enclosures and direct dominances,J. Algorithms,10:170–186 (1989).

    Google Scholar 

  7. M. H. Overmars and D. Wood, On rectangular visibility,J. Algorithms,9:372–390 (1988).

    Google Scholar 

  8. M. Bern, Hidden surface removal for rectangles,J. Computer System Sciences,40:49–69 (1990).

    Google Scholar 

  9. H. Edelsbrunner and H. A. Maurer, On the intersection of orthogonal objects,Inform. Process. Lett. 13:177–181 (1981).

    Google Scholar 

  10. G. J. E. Rawlins, P. Widmayer, and D. Wood, Hole problems of rectangles in the plane,SIAM J. Discrete Math.,1:86–97 (1988).

    Google Scholar 

  11. N. Friedman, Some results on the effect of arithmetics on comparison problems,Proc. of Symp. on Switching and Automata Theory, pp. 139–143 (1972).

  12. F. P. Preparata and M. I. Shamos,Computational Geometry: an Introduction, Springer-Verlag, New York (1985).

    Google Scholar 

  13. R. Cole, Parallel merge sort,SIAM J. Computation,17:770–785 (1988).

    Google Scholar 

  14. C. P. Kruskal, L. Rudolph, and M. Snir, The power of parallel prefix,IEEE Trans. on Computers,34:965–968 (1985).

    Google Scholar 

  15. R. J. Anderson, E. W. Mayr, and M. K. Warmuth, Parallel approximation algorithms for bin packing, Inf. Computation,82:262–277 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Alabama at Birmingham, 35294, Birmingham, Alabama

    Alan P. Sprague

Authors
  1. Alan P. Sprague
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sprague, A.P. A parallel algorithm to construct a dominance graph on nonoverlapping rectangles. Int J Parallel Prog 21, 303–312 (1992). https://doi.org/10.1007/BF01421677

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Search

Navigation