Computing on a systolic screen: Hulls, contours and applications

  • Frank Dehne
  • Jörg-Rüdiger Sack
  • Nicola Santoro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)


Computational Geometry Systolic Array Longe Common Subsequence Processor Element Digitize Plane 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AG85]
    M.J. Atallah, M.T. Goodrich, EFFICIENT PARALLEL SOLUTIONS TO GEOMETRIC PROBLEMS, Report CSD-TR-504, Purdue Univ., March 1985Google Scholar
  2. [AHU76]
    A.V. Aho, D.S. Hirschberg, J.D. Ullamn, BOUNDS ON THE COMPLEXITY OF THE LONGEST SUBSEQUENCE PROBLEM, J. ACM, Vol. 23, No. 1, 1976, pp 1–12Google Scholar
  3. [AH85]
    M.J. Atallah, S.E. Hambrusch, SOLVING TREE PROBLEMS ON A MESH-CONNECTED PROCESSOR ARRAY, Report CSD-TR-518, Purdue Univ., West Lafayette, April 1985.Google Scholar
  4. [AK84]
    M.J. Attalah, S.R. Kosaraju, GRAPH PROBLEMS ON A MESH-CONNECTED PROCESSOR ARRAY, J. ACM, Vol. 31, No. 3, July 1984, pp 649–667Google Scholar
  5. [Ch83]
    B.M. Chazelle, OPTIMAL ALGORITHMS FOR COMPUTING DEPTHS AND LAYERS, Proc. 21st Allerton Conference on Communication Control and Computing, Oct. 1983, pp 427–436Google Scholar
  6. [Ch84]
    B.M. Chazelle, COMPUTATIONAL GEOMETRY ON A SYSTOLIC CHIP, IEEE Trans. on Computers, Vol. C-33, No. 9, Sept. 1984, pp. 774–785Google Scholar
  7. [CGL83]
    B. Chazelle, L.J. Guibas, D.T. /Lee, THE POWER OF GEOMETRIC DUALITY, Proc. 24th IEEE Symp. on Found. of Computer Science, Tucson, Ariz., 1983Google Scholar
  8. [De85a]
    F. Dehne, SOLVING GEOMETRIC PROBLEMS ON MESH-CONNECTED AND ONE DIMENSIONAL PROCESSOR ARRAYS, in H. Noltemeier (ed.), Proceedings of the WG'85 International Workshop on Graphtheoretic Concepts in Computer Science, June 18–21, 1985, Linz: Trauner Verlag, 1985, pp 43–59Google Scholar
  9. [De85b]
    F. Dehne, A ONE DIMENSIONAL SYSTOLIC ARRAY FOR THE LARGESTt EMPTY RECTANGLE PROBLEM, Proc. of the 23rd Annual Allerton Conference on Communication, Control and Computing, Monticello, Illinois, October 2–4, 1985, pp 518–528Google Scholar
  10. [De85c]
    F. Dehne, O(N1/2) ALGORITHMS FOR THE MAXIMAL ELEMENTS AND ECDF SEARCHING PROBLEM ON A MESH-CONNECTED PARALLEL COMPUTER, Information Procesing Letters, Vol 22, No 6, May 1986, pp 303–306Google Scholar
  11. [DL81]
    P.E. Danielson, S. Levialdi, COMPUTER ARCHITECTURE FOR PICTORIAL INFORMATION SYSTEMS, IEEE Computer, Nov. 1981Google Scholar
  12. [DSS86]
    F. Dehne, J.-R. Sack, N. Santoro, COMPUTING ON A SYSTOLIC SECREEN: HULLS, CONTOURS AND APPLICATIONS, Tech. Rept., School of Computer Science, Carleton University, Ottawa, July 1986.Google Scholar
  13. [[Ha83]
    S.E. Hambrusch, VLSI ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM, SIAM J. COMPUT., Vol. 12, No. 2, May 1983, pp.354–365Google Scholar
  14. [Hi77]
    D.S. Hirschbeg, ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, J.ACM, Vol. 24, No. 4, 1977, pp 664–675Google Scholar
  15. [Hi78]
    D.S. Hirschberg, AN INFORMATION THEORETIC LOWER BOUND FOR THE LARGEST COMMON SUBSEQUENCE PROBLEM, Inform. Proc. Lett., Vol. 7, No. 1, 1978, pp 40–41Google Scholar
  16. [Hu72]
    P.J. Huber, ROBUST STATISTICS: A REVIEW, Ann. Math. Stat., Vol.43, No.4, 1972, pp 1041–1067Google Scholar
  17. [HF83]
  18. [HS77]
    J.W. Hunt, T.G. Szymanski, A FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES, C. ACM, Vol. 20, 1977, pp 350–353Google Scholar
  19. [Ki82]
    C.E. Kim, DIGITAL DISKS, Report CS-82-104, Computer Science Dept., Washington State University, Dec. 1982Google Scholar
  20. [Kl79]
    R. Klette, A PARALLEL COMPUTER FOR IMAGE PROCESSING, Elektronische Informationsverarbeitung und Kybernetik, EIK 15 (1979) 56/6, pp.237–263Google Scholar
  21. [Le79]
    C.E. Leiserson, SYSTOLIC PRIORITY QUEUES, Proc CALTECH Conference on VLSI, (ed. C. E. Leitz), California Institut of Technologies, Pasadana, CA, 1979Google Scholar
  22. [[LP84]
    D.T. Lee, F.P. Preparata, COMPUTATIONAL GEOMETRY — A SURVEY, IEEE Trans. on Computers, Vol. C-33, No. 12, Dec. 1984, pp 1072–1101Google Scholar
  23. [LP85]
    E. Lodi, L. Pagli, A VLSI ALGORITHM FOR A VISIBILITY PROBLEM, in Bertolazzi, Luccio (Ed.), 'VLSI: Algorithms an Architecures', North Holland, 1985Google Scholar
  24. [Mi84]
    P.L. Mills, THE SYSTOLIC PIXEL: A VISIBLE SURFACE ALGORITHM FOR VLSI, Computer Graphics Forum 3, North Holland '1984Google Scholar
  25. [Mo70]
    G.U. Montanari, ON LIMIT PROPERTIES IN DIGITIZATION SCHEMES, J. ACM 17, 1970, pp 348–360Google Scholar
  26. [Mo82]
    M.F. Montuno, A. Fournier FINDING THE X-Y CONVEX HULL OF A SET OF X-Y POLYGONS", Report, CSRG-148, University of Toronto, Toronto, Nov. 1982.Google Scholar
  27. [MS84]
    R. Miller, Q.F. Stout, COMPUTATIONAL GEOMETRY ON A MESH-CONNECTED COMPUTER, Proc. Int. Conf. on Parallel Processing, 1984Google Scholar
  28. [MS85]
    R. Miller, Q.F. Stout, GEOMETRIC ALGORITHMS FOR DIGITIZED PICTURES ON A MESH-CONNECTED COMPUTER, IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-7, No. 2, March 1985, pp 216–228Google Scholar
  29. [NKY82]
    N. Nakatsu, Y. Kambayashi, S. Yajima, A LONGEST COMMON SUBSEQUENCE ALGORITHM SUITABLE FOR SIMILAR TEXT STRINGS, Acta Informatica 18 (1982), pp 171–179Google Scholar
  30. [NS79]
    D. Nassimi, S. Sahni, BITONIC SORT ON A MESH-CONNECTED PARALLEL COMPUTER, IEEE Trans. on Computers, Vol. C-28, No. 1, Jan. 1979, pp.2–7Google Scholar
  31. [NS80]
  32. [NS81]
    D. Nassimi, S. Sahni, DATA BROADCASTING IN SIMD COMPUTERS, IEEE Trans. on Computers, Vol. C-30, No. 2, Feb. 1981, pp 101–106Google Scholar
  33. [OL81]
    M.H. Overmars, J.V. Leeuwen, MAINTENANCE OF CONFIGURATIONS IN THE PLANE, Report RUU-CS-81-3, Dept. of Computer Science, Univ. of Utrecht, Feb. 1981Google Scholar
  34. [Pr84]
    F.P. Preparata, VLSI ALGORITHMS AND ARCHITECTURES, Proc. Mathematical Foundations of Computers Science, Praha 1984, Lecture Notes in Computer Science 176, Springer 1984, pp 149–161Google Scholar
  35. [PS85]
    F.P. Preparata, M.I. Shamos, COMPUTATIONAL GEOMETRY, Springer 1985Google Scholar
  36. [Re84]
    A.P. Reeves, SURVEY, PARALLEL COMPUTER ARCHITECTURES FOR IMAGE PROCESSING, Computer Vision, Graphics, and Image Processing 25, 1984, pp 68–88Google Scholar
  37. [Ro79]
    A. Rosenfeld, DIGITAL TOPOLOGY, Amer. Math. Monthly 86, 1979, pp 621–630Google Scholar
  38. [RT85]
    Y. Robert, M. Tchuente, A SYSTOLIC ARRAY FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, Inform. Proc. Lett., Vol. 21, Oct. 1985, pp 191–198Google Scholar
  39. [Sa84]
    J.-R. Sack, RECTILINEAR COMPUTATIONAL GEOMETRY, Technical Report SCS-TR-54, School of Computer Science, Carleton Univ., Ottawa, June 1984Google Scholar
  40. [Sh76]
    M.I. Shamos, GEOMETRY AND STATISTICS: PROBLEMS AT THE INTERFACE, in J.F. Traub (ed.), Algorithms and Complexity, Academic Press, New York 1976, pp.251–280Google Scholar
  41. [Sh78]
    M.I. Shamos, COMPUTATIONAL GEOMETRY, Ph.D. Thesis, Yale Univ., 1978Google Scholar
  42. [SM84]
    Q.F. Stout, R.Miller, MESH-CONNECTED COMPUTER ALGORITHMS FOR DETERMINATING GEOMETRIC PROPERTIES OF FIGURES, 7th Int. Conf. on Pattern Recognition, Montreal, Canada, July 30–August 2, 1984Google Scholar
  43. [Sn81]
    L. Snyder, OVERVIEW OF THE CHIP COMPUTER, in VLSI 81: Very Large Scale Integration (ed. J.P. Gray), Academic Press, London, 1981, pp.237–246Google Scholar
  44. [Sn82]
    L. Snyder, INTRODUCTION TO THE CONFIGURABLE HIGHLY PARALLEL COMPUTER, IEEE Computer 15 (1), Jan. 1982, pp.47–65Google Scholar
  45. [Sp85a]
    Th. Spindler, BILDVERARBEITUNG ALS WERKZUEG FÜR COMPUTATIONAL GEOMETRY PROBLEM?, Lecture presented at 3rd Workshop on Computational Geometry, Karlsruhe, March 1985Google Scholar
  46. [Sp85b]
    Th. Spindler, private communicationGoogle Scholar
  47. [St83]
    Q.F. Stout, MESH-CONNECTED COMPUTERS WITH BROADCASTING, IEEE Trans. on Computers, Vol. C-32, No. 9, Sept. 1983, pp826–830Google Scholar
  48. [TK77]
    C.D. Thompson and H.T. Kung, SORTING ON A MESH-CONNECTED PARALLEL COMPUTER, Comm. of the ACM, Vol. 20, No. 4, April 1977, pp. 263–270Google Scholar
  49. [U184]
    J.D. Ullman, COMPUTATIONAL ASPECTS OF VLSI, Principles of Computer Science Series, Computer Science Press, 1984Google Scholar
  50. [Un58]
    S.H. Unger, A COMPUTER ORIENTED TOWARDS SPACIAL INTERACTION, Proc. IRE, Vol.46, 1958, pp. 1744–1750Google Scholar
  51. [Wo84]
    D. Wood, AN ISOTHETIC VIEW OF COMPUTATIONAL GEOMETRY, in Computational Geometry, (ed. G.T. Toussaint), North Holland, 1984, pp. 429–459Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Frank Dehne
    • 1
  • Jörg-Rüdiger Sack
    • 1
  • Nicola Santoro
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations