{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:58Z","timestamp":1725567058976},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_48","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"471-480","source":"Crossref","is-referenced-by-count":2,"title":["Randomly Generating Triangulations of a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Q.","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(92)90075-7","volume":"41","author":"M. Atkinson","year":"1992","unstructured":"Atkinson, M., Sack, J.: \u2018Generating Binary Trees at Random\u2019. Information Processing Letters\u00a041, 21\u201323 (1992)","journal-title":"Information Processing Letters"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: \u2018A Note on the Height of Binary Search Trees\u2019. Journal on ACM\u00a033, 489\u2013498 (1986)","journal-title":"Journal on ACM"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/PL00009444","volume":"22","author":"L. Devroye","year":"1999","unstructured":"Devroye, L., Flajolet, P., Hurtado, F., Noy, M., Steiger, W.: Random Triangulations. Discrete and Computational Geometry\u00a022, 105\u2013117 (1999)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"48_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/189443.189446","volume":"4","author":"P. Epstein","year":"1994","unstructured":"Epstein, P., Sack, J.: Generating triangulation at Random. ACM Trans. On Modeling and Computer Simulation\u00a04(3), 267\u2013278 (1994)","journal-title":"ACM Trans. On Modeling and Computer Simulation"},{"key":"48_CR5","unstructured":"Epstein, P.: Generating geometric objects at random\u2019, Master\u2019s thesis, School of Computer Science, Carleton university, Canada (1992)"},{"key":"48_CR6","unstructured":"Bern, M., Eppstein, D.: Mesh Generation And Optimal Triangulation. In: Du, D.-Z., Hwang, F. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol.\u00a01, World Scientific, Singapore"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"Welzl, E.: Constructing the visibility graph for n line segments in O(n2) time. Information Processing Letters\u00a020, 167\u2013171 (1985)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:19:45Z","timestamp":1553152785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11533719_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}