{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:57:50Z","timestamp":1771297070880,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6-8","license":[{"start":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T00:00:00Z","timestamp":1399334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00371-014-0948-z","type":"journal-article","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T23:18:30Z","timestamp":1399331910000},"page":"773-785","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient triangulation of Poisson-disk sampled point sets"],"prefix":"10.1007","volume":"30","author":[{"given":"Jianwei","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Ming","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanbo","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiming","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Wonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"4","key":"948_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3\u20134","key":"948_CR2","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\u20134), 243\u2013269 (1999)","journal-title":"Algorithmica"},{"key":"948_CR3","unstructured":"CGAL, Computational Geometry Algorithms Library. http:\/\/www.cgal.org"},{"key":"948_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: Proceedings of the 16th International Meshing Roundtable, pp. 477\u2013494 (2007)","DOI":"10.1007\/978-3-540-75103-8_27"},{"key":"948_CR5","volume-title":"Delaunay Mesh Generation","author":"SW Cheng","year":"2012","unstructured":"Cheng, S.W., Dey, T.K., Shewchuk, J.R.: Delaunay Mesh Generation. CRC Press, Boca Raton (2012)"},{"key":"948_CR6","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: Guaranteed-quality triangular meshes. Department of Computer Science Tech Report 89-983, Cornell University (1989)","DOI":"10.21236\/ADA210101"},{"issue":"2","key":"948_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/nme.765","volume":"58","author":"N Chrisochoides","year":"2003","unstructured":"Chrisochoides, N., Nave, D.: Parallel delaunay mesh generation kernel. Int. J. Numer. Methods Eng. 58(2), 161\u2013176 (2003)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"3","key":"948_CR8","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1015706.1015817","volume":"23","author":"D Cohen-Steiner","year":"2004","unstructured":"Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Trans. Graph. (Proc. SIGGRAPH) 23(3), 905\u2013914 (2004)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"issue":"1","key":"948_CR9","first-page":"69","volume":"5","author":"RL Cook","year":"1986","unstructured":"Cook, R.L.: Stochastic sampling in computer graphics. ACM Trans. Graph. 5(1), 69\u201378 (1986)","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"948_CR10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/1141911.1141915","volume":"25","author":"D Dunbar","year":"2006","unstructured":"Dunbar, D., Humphreys, G.: A spatial data structure for fast poisson-disk sample generation. ACM Trans. Graph. (Proc. SIGGRAPH) 25(3), 503\u2013508 (2006)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"issue":"11","key":"948_CR11","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1016\/j.cad.2011.08.012","volume":"43","author":"MS Ebeida","year":"2011","unstructured":"Ebeida, M.S., Mitchell, S.A., Davidson, A.A., Patney, A., Knupp, P.M., Owens, J.D.: Efficient and good delaunay meshes from random points. Comput. Aided Des. 43(11), 1506\u20131515 (2011)","journal-title":"Comput. Aided Des."},{"issue":"2","key":"948_CR12","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1111\/j.1467-8659.2012.03059.x","volume":"31","author":"MS Ebeida","year":"2012","unstructured":"Ebeida, M.S., Mitchell, S.A., Patney, A., Davidson, A.A., Owens, J.D.: A simple algorithm for maximal poisson-disk sampling in high dimensions. Comput. Graph. Forum (Proc. EUROGRAPHICS) 31(2), 785\u2013794 (2012)","journal-title":"Comput. Graph. Forum (Proc. EUROGRAPHICS)"},{"issue":"4","key":"948_CR13","doi-asserted-by":"crossref","first-page":"49:1","DOI":"10.1145\/2010324.1964944","volume":"30","author":"MS Ebeida","year":"2011","unstructured":"Ebeida, M.S., Patney, A., Mitchell, S.A., Davidson, A., Knupp, P.M., Owens, J.D.: Efficient maximal poisson-disk sampling. ACM Trans. Graph. (Proc. SIGGRAPH) 30(4), 49:1\u201349:12 (2011)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"948_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530067","volume-title":"Geometry and Topology for Mesh Generation","author":"H Edelsbrunner","year":"2001","unstructured":"Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"948_CR15","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/1640443.1640451","volume":"29","author":"MN Gamito","year":"2009","unstructured":"Gamito, M.N., Maddock, S.C.: Accurate multidimensional poisson-disk sampling. ACM Trans. Graph. 29(1), 8:1\u20138:19 (2009)","journal-title":"ACM Trans. Graph."},{"key":"948_CR16","doi-asserted-by":"crossref","unstructured":"Hoff III, K.E., Keyser, J., Lin, M., Manocha, D., Culver, T.: Fast computation of generalized Voronoi diagrams using graphics hardware. In: Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH \u201999, pp. 277\u2013286 (1999)","DOI":"10.1145\/311535.311567"},{"issue":"2","key":"948_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/2151237X.2006.10129217","volume":"11","author":"TR Jones","year":"2006","unstructured":"Jones, T.R.: Efficient generation of poisson-disk sampling patterns. J. Graph. Tools 11(2), 27\u201336 (2006)","journal-title":"J. Graph. Tools"},{"issue":"1","key":"948_CR18","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1111\/j.1467-8659.2007.01100.x","volume":"27","author":"A Lagae","year":"2008","unstructured":"Lagae, A., Dutr\u00e9, P.: A comparison of methods for generating poisson disk distributions. Comput. Graph. Forum 27(1), 114\u2013129 (2008)","journal-title":"Comput. Graph. Forum"},{"key":"948_CR19","unstructured":"Lu, Y., Lien, J.-M., Ghosh, M., Amato, N.M.: Alpha-decomposition of polygons. Comput. Graph. (Proc. SMI) 36(5), 466\u2013476 (2012)"},{"issue":"5","key":"948_CR20","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TVCG.2012.307","volume":"19","author":"M Qi","year":"2013","unstructured":"Qi, M., Cao, T.T., Tan, T.S.: Computing 2d constrained delaunay triangulation using the gpu. IEEE Trans. Vis. Comput. Graph. 19(5), 736\u2013748 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"948_CR21","doi-asserted-by":"crossref","unstructured":"Rong, G., Tan, T.S., Cao, T.T., et al.: Computing two-dimensional Delaunay triangulation using graphics hardware. In: Proceedings of the 2008 Symposium on Interactive 3D Graphics and Games, pp. 89\u201397. ACM (2008)","DOI":"10.1145\/1342250.1342264"},{"issue":"4","key":"948_CR22","doi-asserted-by":"crossref","first-page":"61:1","DOI":"10.1145\/2185520.2185557","volume":"31","author":"H Schechter","year":"2012","unstructured":"Schechter, H., Bridson, R.: Ghost sph for animating water. ACM Trans. Graph. (Proc. SIGGRAPH) 31(4), 61:1\u201361:8 (2012)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"948_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry: Towards Geometric Engineering","author":"JR Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: engineering a 2d quality mesh generator and delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) Applied Computational Geometry: Towards Geometric Engineering. Lecture Notes in Computer Science, vol. 1148, pp. 203\u2013222. Springer, Berlin (1996)"},{"issue":"1","key":"948_CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(01)00047-5","volume":"22","author":"JR Shewchuk","year":"2002","unstructured":"Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Comput. Geom. Theory Appl. 22(1), 21\u201374 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"948_CR25","first-page":"20:1","volume":"27","author":"LY Wei","year":"2008","unstructured":"Wei, L.Y.: Parallel poisson disk sampling. ACM Trans. Graph. (Proc. SIGGRAPH) 27(3), 20:1\u201320:9 (2008)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"issue":"4","key":"948_CR26","first-page":"79:1","volume":"29","author":"LY Wei","year":"2010","unstructured":"Wei, L.Y.: Multi-class blue noise sampling. ACM Trans. Graph. (Proc. SIGGRAPH) 29(4), 79:1\u201379:8 (2010)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"948_CR27","doi-asserted-by":"crossref","unstructured":"White, K.B., Cline, D., Egbert, P.K.: Poisson disk point sets by hierarchical dart throwing. In: Proceedings of the IEEE Symposium on Interactive Ray Tracing, pp. 129\u2013132 (2007)","DOI":"10.1109\/RT.2007.4342600"},{"issue":"5","key":"948_CR28","first-page":"148:1","volume":"32","author":"DM Yan","year":"2013","unstructured":"Yan, D.M., Wonka, P.: Gap processing for adaptive maximal poisson-disk sampling. ACM Trans. Graph. 32(5), 148:1\u2013148:15 (2013)","journal-title":"ACM Trans. Graph."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-014-0948-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-014-0948-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-014-0948-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T06:22:40Z","timestamp":1565418160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-014-0948-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,6]]},"references-count":28,"journal-issue":{"issue":"6-8","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1007\/s00371-014-0948-z","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,6]]}}}