Preview
Unable to display preview. Download preview PDF.
References
M.J. Atallah, M.T. Goodrich, EFFICIENT PARALLEL SOLUTIONS TO GEOMETRIC PROBLEMS, Report CSD-TR-504, Purdue Univ., March 1985
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–12
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.
M.J. Attalah, S.R. Kosaraju, GRAPH PROBLEMS ON A MESH-CONNECTED PROCESSOR ARRAY, J. ACM, Vol. 31, No. 3, July 1984, pp 649–667
B.M. Chazelle, OPTIMAL ALGORITHMS FOR COMPUTING DEPTHS AND LAYERS, Proc. 21st Allerton Conference on Communication Control and Computing, Oct. 1983, pp 427–436
B.M. Chazelle, COMPUTATIONAL GEOMETRY ON A SYSTOLIC CHIP, IEEE Trans. on Computers, Vol. C-33, No. 9, Sept. 1984, pp. 774–785
B. Chazelle, L.J. Guibas, D.T. /Lee, THE POWER OF GEOMETRIC DUALITY, Proc. 24th IEEE Symp. on Found. of Computer Science, Tucson, Ariz., 1983
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–59
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–528
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–306
P.E. Danielson, S. Levialdi, COMPUTER ARCHITECTURE FOR PICTORIAL INFORMATION SYSTEMS, IEEE Computer, Nov. 1981
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.
S.E. Hambrusch, VLSI ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM, SIAM J. COMPUT., Vol. 12, No. 2, May 1983, pp.354–365
D.S. Hirschbeg, ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, J.ACM, Vol. 24, No. 4, 1977, pp 664–675
D.S. Hirschberg, AN INFORMATION THEORETIC LOWER BOUND FOR THE LARGEST COMMON SUBSEQUENCE PROBLEM, Inform. Proc. Lett., Vol. 7, No. 1, 1978, pp 40–41
P.J. Huber, ROBUST STATISTICS: A REVIEW, Ann. Math. Stat., Vol.43, No.4, 1972, pp 1041–1067
K. Hwang, K.S. Fu, INTEGRATED COMPUTER ARCHITECTURES FOR IMAGE PROCESSING AND DATABASE MANAGEMENT, IEEE Computer, Vol.16, pp.51–61, Jan. 1983
J.W. Hunt, T.G. Szymanski, A FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES, C. ACM, Vol. 20, 1977, pp 350–353
C.E. Kim, DIGITAL DISKS, Report CS-82-104, Computer Science Dept., Washington State University, Dec. 1982
R. Klette, A PARALLEL COMPUTER FOR IMAGE PROCESSING, Elektronische Informationsverarbeitung und Kybernetik, EIK 15 (1979) 56/6, pp.237–263
C.E. Leiserson, SYSTOLIC PRIORITY QUEUES, Proc CALTECH Conference on VLSI, (ed. C. E. Leitz), California Institut of Technologies, Pasadana, CA, 1979
D.T. Lee, F.P. Preparata, COMPUTATIONAL GEOMETRY — A SURVEY, IEEE Trans. on Computers, Vol. C-33, No. 12, Dec. 1984, pp 1072–1101
E. Lodi, L. Pagli, A VLSI ALGORITHM FOR A VISIBILITY PROBLEM, in Bertolazzi, Luccio (Ed.), 'VLSI: Algorithms an Architecures', North Holland, 1985
P.L. Mills, THE SYSTOLIC PIXEL: A VISIBLE SURFACE ALGORITHM FOR VLSI, Computer Graphics Forum 3, North Holland '1984
G.U. Montanari, ON LIMIT PROPERTIES IN DIGITIZATION SCHEMES, J. ACM 17, 1970, pp 348–360
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.
R. Miller, Q.F. Stout, COMPUTATIONAL GEOMETRY ON A MESH-CONNECTED COMPUTER, Proc. Int. Conf. on Parallel Processing, 1984
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–228
N. Nakatsu, Y. Kambayashi, S. Yajima, A LONGEST COMMON SUBSEQUENCE ALGORITHM SUITABLE FOR SIMILAR TEXT STRINGS, Acta Informatica 18 (1982), pp 171–179
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–7
D. Nassami, S. Sahni, FINDING CONNECTED COMPONENTS AND CONNECTED ONES ON A MESH-CONNECTED PARALLEL COMPUTER, SIAM J. COMPUT., Vol. 9, No. 4, Nov. 1980, pp.744–767
D. Nassimi, S. Sahni, DATA BROADCASTING IN SIMD COMPUTERS, IEEE Trans. on Computers, Vol. C-30, No. 2, Feb. 1981, pp 101–106
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. 1981
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–161
F.P. Preparata, M.I. Shamos, COMPUTATIONAL GEOMETRY, Springer 1985
A.P. Reeves, SURVEY, PARALLEL COMPUTER ARCHITECTURES FOR IMAGE PROCESSING, Computer Vision, Graphics, and Image Processing 25, 1984, pp 68–88
A. Rosenfeld, DIGITAL TOPOLOGY, Amer. Math. Monthly 86, 1979, pp 621–630
Y. Robert, M. Tchuente, A SYSTOLIC ARRAY FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, Inform. Proc. Lett., Vol. 21, Oct. 1985, pp 191–198
J.-R. Sack, RECTILINEAR COMPUTATIONAL GEOMETRY, Technical Report SCS-TR-54, School of Computer Science, Carleton Univ., Ottawa, June 1984
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–280
M.I. Shamos, COMPUTATIONAL GEOMETRY, Ph.D. Thesis, Yale Univ., 1978
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, 1984
L. Snyder, OVERVIEW OF THE CHIP COMPUTER, in VLSI 81: Very Large Scale Integration (ed. J.P. Gray), Academic Press, London, 1981, pp.237–246
L. Snyder, INTRODUCTION TO THE CONFIGURABLE HIGHLY PARALLEL COMPUTER, IEEE Computer 15 (1), Jan. 1982, pp.47–65
Th. Spindler, BILDVERARBEITUNG ALS WERKZUEG FÜR COMPUTATIONAL GEOMETRY PROBLEM?, Lecture presented at 3rd Workshop on Computational Geometry, Karlsruhe, March 1985
Th. Spindler, private communication
Q.F. Stout, MESH-CONNECTED COMPUTERS WITH BROADCASTING, IEEE Trans. on Computers, Vol. C-32, No. 9, Sept. 1983, pp826–830
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–270
J.D. Ullman, COMPUTATIONAL ASPECTS OF VLSI, Principles of Computer Science Series, Computer Science Press, 1984
S.H. Unger, A COMPUTER ORIENTED TOWARDS SPACIAL INTERACTION, Proc. IRE, Vol.46, 1958, pp. 1744–1750
D. Wood, AN ISOTHETIC VIEW OF COMPUTATIONAL GEOMETRY, in Computational Geometry, (ed. G.T. Toussaint), North Holland, 1984, pp. 429–459
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dehne, F., Sack, JR., Santoro, N. (1987). Computing on a systolic screen: Hulls, contours and applications. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_124
Download citation
DOI: https://doi.org/10.1007/3-540-17943-7_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17943-6
Online ISBN: 978-3-540-47144-8
eBook Packages: Springer Book Archive