{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:08:33Z","timestamp":1648537713286},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf02238727","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:13:42Z","timestamp":1132017222000},"page":"19-40","source":"Crossref","is-referenced-by-count":0,"title":["Systolic algorithms for computational geometry problems \u2014 A survey"],"prefix":"10.1007","volume":"41","author":[{"given":"H.","family":"Umeo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238727_CR1","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry, an introduction","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., Shamos, M. I.: Computational geometry, an introduction, p. 390. New York: Springer-Verlag 1985."},{"issue":"No. 12","key":"BF02238727_CR2","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"33","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T., Preparata, F. P.: Computational geometry \u2014 a survey. IEEE Trans. on Computers. Vol. C-33, No. 12, pp. 1072\u20131101 (1984).","journal-title":"IEEE Trans. on Computers"},{"key":"BF02238727_CR3","unstructured":"Leiserson, C. E.: Systolic priority queues. Proc. of the Caltech Conf. on VLSI (Deitz, C. E., ed.), pp. 199\u2013214 (1979)."},{"key":"BF02238727_CR4","unstructured":"Kung, H. T.: Let's design algorithms for VLSI systems. Proc. of the Caltech Conf. on VLSI (Deitz, C. E., ed.), pp. 55\u201390 (1979)."},{"key":"BF02238727_CR5","volume-title":"Introduction to VLSI Systems","author":"H. T. Kung","year":"1980","unstructured":"Kung, H. T., Leiserson, C. E.: Algorithms for VLSI processor arrays, in Chapter 8 of Mead, C. A. and Coway, L. A. Introduction to VLSI Systems. Reading, Massachusetts: Addison-Wesley 1980."},{"key":"BF02238727_CR6","doi-asserted-by":"crossref","unstructured":"Savage, C.: A systolic data structure chip for connectivity problems, in VLSI systems and computations (Kung, H. T., Sproull, R. F., Steele, G. L., Jr., eds.), pp. 269\u2013300 (1981).","DOI":"10.1007\/978-3-642-68402-9_32"},{"issue":"No. 9","key":"BF02238727_CR7","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/TC.1984.1676494","volume":"33","author":"B. Chazelle","year":"1984","unstructured":"Chazelle, B.: Computational geometry on a systolic chip. IEEE Trans. on Computers, Vol. C-33, No. 9, pp. 774\u2013785 (1984).","journal-title":"IEEE Trans. on Computers, Vol. C"},{"key":"BF02238727_CR8","doi-asserted-by":"crossref","unstructured":"Kane, R., Sahni, S.: A systolic design rule checker. Proc. of the IEEE 21 st Design Automation Conf., pp. 243\u2013250 (1984).","DOI":"10.1109\/DAC.1984.1585802"},{"key":"BF02238727_CR9","unstructured":"Kane, R., Sahni, S.: Hardware algorithm for net extraction. Proc. of the IEEE ISCAS85, pp. 51\u201354 (1985)."},{"key":"BF02238727_CR10","unstructured":"Kane, R., Sahni, S.: Systolic algorithms for rectilinear polygons. Proc. of the IEEE Intern. Conf. on Computer Design: VLSI in Computers ICCD'84, pp. 831\u2013836 (1984)."},{"key":"BF02238727_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0167-8191(88)90085-3","volume":"6","author":"T. Asano","year":"1988","unstructured":"Asano, T., Umeo, H.: Systolic algorithms for computing the visivility polygon and triangulation of a polygonal region. Parallel Computing6, 209\u2013216 (1988).","journal-title":"Parallel Computing"},{"issue":"No. 2","key":"BF02238727_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/12527.12532","volume":"30","author":"Z. C. Shih","year":"1987","unstructured":"Shih, Z. C., Chen, G. H., Lee, R. C. T.: Systolic algorithms to examine all pairs of elements. Commun. ACM, Vol. 30, No. 2, pp. 161\u2013167 (1987).","journal-title":"Commun. ACM"},{"key":"BF02238727_CR13","unstructured":"IEEE Computer: Special issue on Systolic Arrays (Fortes, J. A. B., Wah, B. W., eds.) Vol. 20, No. 7 (1987)."},{"key":"BF02238727_CR14","unstructured":"Lodi, E., Pagli, L: A VLSI algorithm for a visibility problem, in VLSI: Algorithms and Architectures (Bertolazzi, P., Luccio, F., eds.), pp. 125\u2013134. North-Holland: Elsevier Science Publisher, B. V., 1985."},{"key":"BF02238727_CR15","first-page":"1","volume":"17","author":"R. E. Tarjan","year":"1988","unstructured":"Tarjan, R. E., Van Wyk, C. J.: AnO(nloglogn)-time algorithm for triangulating a simple polygon. SIAM J. on Computing 17, 1 (1988), to appear.","journal-title":"SIAM J. on Computing"},{"key":"BF02238727_CR16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-18099-0_45","volume-title":"Parallel Algorithms and Architectures","author":"C. K. Yap","year":"1987","unstructured":"Yap, C. K.: What can be paralleilized in computational geometry? Parallel Algorithms and Architectures (Albrecht, A., Jung, H., Mehlhorn, K. eds.), pp. 184\u2013195. Berlin: Akademie-Verlag (1987)."},{"key":"BF02238727_CR17","unstructured":"Toussaint, G. T.: Pattern recognition and geometrical complexity. Proc. of the 5th Intern. Conf. on Pattern Recognition, pp. 1324\u20131347 (1980)."},{"key":"BF02238727_CR18","unstructured":"Miller, R., Stout, Q. F.: Mesh computer algorithms for computational geometry. Tech. Rep. of State University of New York, 86-18, p. 44 (1986)."},{"key":"BF02238727_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TPAMI.1981.4767048","volume":"3","author":"C. R. Dyer","year":"1981","unstructured":"Dyer, C. R.: Parallel image processing by memory augmented cellular automata. IEEE Trans. on PAMI, Vol. PAMI-3, pp. 29\u201341 (1981).","journal-title":"IEEE Trans. on PAMI"},{"key":"BF02238727_CR20","doi-asserted-by":"crossref","unstructured":"Miller, R., Stout, Q. F.: Pyramid computer algorithms for determining geometric properties of images. Proc. of the Symp. on Computational Geometry, pp. 263\u2013271 (1985).","DOI":"10.1145\/323233.323267"},{"key":"BF02238727_CR21","first-page":"66","volume":"87","author":"A. Perez","year":"1987","unstructured":"Perez, A., Abidi, M. A., Bouldin, D. W.: The use of a VLSI sorter coprocessor to find the convex hull. Proc. of Comp Euro 87, pp. 66\u201369 (1987).","journal-title":"Proc. of Comp Euro"},{"key":"BF02238727_CR22","first-page":"699","volume":"87","author":"M. Lu","year":"1987","unstructured":"Lu, M., Varman, P.: Solving geometric problems on a two-dimensional systolic array. Proc. of Comp Euro 87, pp. 699\u2013702 (1987).","journal-title":"Proc. of Comp Euro"},{"key":"BF02238727_CR23","first-page":"870","volume":"87","author":"F. Dehne","year":"1987","unstructured":"Dehne, F.: Computational geometry and VLSI. Proc. of Comp Euro 87, pp. 870\u2013875 (1987).","journal-title":"Proc. of Comp Euro"},{"key":"BF02238727_CR24","unstructured":"Lu, M.: Constructing the Voronoi diagram on a mesh-connected computer. Proc. of the 1986 Intern. Conf. on Parallel Processing, pp. 806\u2013811 (1986)."},{"issue":"No. 2","key":"BF02238727_CR25","first-page":"214","volume":"66-D","author":"M. Sato","year":"1983","unstructured":"Sato, M., Tachibana, M., Torii, S., Ohotsuki, T.: An algorithm for partitioning a set of points on the plane by a rectilinear region. Trans. IECE of Japan, Vol. L 66-D No. 2, pp. 214\u2013219 (1983).","journal-title":"Trans. IECE of Japan"},{"key":"BF02238727_CR26","unstructured":"Asano, T.: Geometric searching algorithms and their applications. Proc. of the Mathematical Programming Symposium, pp. 205\u2013220 (1985)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238727.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238727\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:08:00Z","timestamp":1586556480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF02238727"],"URL":"https:\/\/doi.org\/10.1007\/bf02238727","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}