{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T09:51:02Z","timestamp":1756461062780},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,4]],"date-time":"2011-10-04T00:00:00Z","timestamp":1317686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11075-011-9493-2","type":"journal-article","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T04:43:48Z","timestamp":1317617028000},"page":"347-357","source":"Crossref","is-referenced-by-count":4,"title":["A parallel algorithm based on convexity for the computing of Delaunay tessellation"],"prefix":"10.1007","volume":"59","author":[{"given":"Phan Thanh","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Hong","family":"Trang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,4]]},"reference":[{"key":"9493_CR1","volume-title":"Parallel Computational Geometry","author":"SG Akl","year":"1992","unstructured":"Akl, S.G., Lyons, K.A.: Parallel Computational Geometry. Prentice Hall, Englewood Cliffs (1992)"},{"key":"9493_CR2","doi-asserted-by":"crossref","unstructured":"An, P.T., Trang, L.H.: An efficient convex hull algorithm in 3D based on the method of orienting curves. (to appear in Optimization, 2011)","DOI":"10.1080\/02331934.2011.623163"},{"issue":"2","key":"9493_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/02331930802434732","volume":"59","author":"PT An","year":"2010","unstructured":"An, P.T.: Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization 59(2), 175\u2013179 (2010)","journal-title":"Optimization"},{"issue":"3","key":"9493_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/01630561003757801","volume":"31","author":"PT An","year":"2010","unstructured":"An, P.T., Giang, D.T., Hai, N.N.: Some computational aspects of geodesic convex sets in a simple polygon. Numer. Funct. Anal. Optim. 31(3), 221\u2013231 (2010)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9493_CR5","first-page":"269","volume":"34","author":"PT An","year":"2007","unstructured":"An, P.T.: A modification of Graham\u2019s algorithm for determining the convex hull of a finite planar set. Ann. Math. Inf. 34, 269\u2013274 (2007)","journal-title":"Ann. Math. Inf."},{"key":"9493_CR6","volume-title":"Parallel and Distributed Computing Handbook","author":"MJ Atallah","year":"1995","unstructured":"Atallah, M.J.: Parallel computational geometry. In: Zomaya, A.Y. (ed.) Parallel and Distributed Computing Handbook. McGraw-Hill, New York (1995)"},{"issue":"2","key":"9493_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F Aurenhammer","year":"1984","unstructured":"Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recogn. 17(2), 251\u2013257 (1984)","journal-title":"Pattern Recogn."},{"issue":"3&4","key":"9493_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/PL00008262","volume":"24","author":"GE Blelloch","year":"1999","unstructured":"Blelloch, G.E., Miller, G.L., Hardwick, J.C., Talmor, D.: Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 24(3&4), 243\u2013269 (1999)","journal-title":"Algorithmica"},{"issue":"5","key":"9493_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","volume":"9","author":"KQ Brown","year":"1979","unstructured":"Brown, K.Q.: Voronoi diagrams from convex hulls. Inf. Process. Lett. 9(5), 223\u2013228 (1979)","journal-title":"Inf. Process. Lett."},{"key":"9493_CR10","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1002\/cpe.1007","volume":"18","author":"M-B Chen","year":"2006","unstructured":"Chen, M.-B., Chuang, T.-R., Wu, J.-J.: Parallel divide-and-conquer scheme for 2D Delaunay triangulation. Concurrency and Computation: Practice and Experience 18, 1595\u20131612 (2006)","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"1","key":"9493_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","volume":"1","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Seide, R.: Voronoi diagrams and arrangements. Discrete Comput. Geom. 1(1), 25\u201344 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9493_CR12","volume-title":"Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"issue":"8","key":"9493_CR13","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00371-002-0173-z","volume":"18","author":"I Kolingerov\u00e1","year":"2002","unstructured":"Kolingerov\u00e1, I., Kohout, J.: Optimistic parallel Delaunay triangulation. Vis. Comput. 18(8), 511\u2013529 (2002)","journal-title":"Vis. Comput."},{"key":"9493_CR14","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 1st edn. Wiley, New York (1992)","edition":"1"},{"key":"9493_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational Geometry in C","author":"J O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)","edition":"2"},{"key":"9493_CR16","volume-title":"Computational Geometry\u2014An Introduction","author":"FP Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry\u2014An Introduction, 2nd edn. Springer, New York (1988)","edition":"2"},{"key":"9493_CR17","volume-title":"Convex Sets","author":"FA Valentine","year":"1964","unstructured":"Valentine, F.A.: Convex Sets. McGraw-Hill, New York (1964)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9493-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9493-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9493-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T22:48:04Z","timestamp":1560725284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9493-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,4]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9493"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9493-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,4]]}}}