{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:49Z","timestamp":1750306489264,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":5,"publisher":"ACM Press","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1145\/2817460.2817476","type":"proceedings-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T16:48:13Z","timestamp":1440607693000},"page":"63-65","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Delaunay triangulation on the Intel Paragon"],"prefix":"10.1145","author":[{"given":"Fenglien","family":"Lee","sequence":"first","affiliation":[]}],"member":"320","reference":[{"key":"key-10.1145\/2817460.2817476-1","doi-asserted-by":"crossref","unstructured":"B. Chazelle, \"Computational Geometry on a Systolic Chip,\"IEEE Transactions on Computers, Vol. C-33, No. 9, Sept. 1984, pp774--785.","DOI":"10.1109\/TC.1984.1676494"},{"key":"key-10.1145\/2817460.2817476-2","doi-asserted-by":"crossref","unstructured":"D. MacKenzie and Q. F. Stout, \"Asymptotically Efficient Hypercube Algorithms for Computational Geometry,\"Proceedings of the Third Symposium on the Frontiers of Massively Parallel Computation, October 1990, pp8--11","DOI":"10.1109\/FMPC.1990.89429"},{"key":"key-10.1145\/2817460.2817476-3","doi-asserted-by":"crossref","unstructured":"Saxena, P.C.P. Bhatt, and V. C. Prasad, \"Efficient VLSI Parallel for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions,\"IEEE Transactions on Computers, Vol. 39, No. 3, March 1990, pp400--404.","DOI":"10.1109\/12.48871"},{"key":"key-10.1145\/2817460.2817476-4","doi-asserted-by":"crossref","unstructured":"F. Wang and Y. H. Tsin, \"AnO(log N) Time Parallel Algorithm for Triangulating a Set of Points in the Plane,\"Information Processing Letters, Vol. 25, 1987, pp55--60.","DOI":"10.1016\/0020-0190(87)90093-7"},{"key":"key-10.1145\/2817460.2817476-5","unstructured":"Paragon User's Guide, Intel Supercomputer System Division, 1994."}],"event":{"name":"the 35th Annual Southeast Regional Conference","start":{"date-parts":[[1997,4,2]]},"number":"35","location":"Murfreesboro, Tennessee","end":{"date-parts":[[1997,4,4]]},"acronym":"ACM-SE 35"},"container-title":["Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2817460.2817476","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2817476&ftid=1616137&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:33Z","timestamp":1750225713000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2817460.2817476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":5,"URL":"https:\/\/doi.org\/10.1145\/2817460.2817476","relation":{},"subject":[],"published":{"date-parts":[[1997]]}}}