{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:49Z","timestamp":1760440489713},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340706"},{"type":"electronic","value":"9783540340713"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751540_1","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T08:28:51Z","timestamp":1147249731000},"page":"1-9","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bound on Dilation of Triangulations of Cyclic Polygons"],"prefix":"10.1007","author":[{"given":"Narayanasetty","family":"Amarnadh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinaki","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences\u00a039, 205\u2013219 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry\u00a05, 399\u2013407 (1990)","journal-title":"Discrete and Computational Geometry"},{"key":"1_CR3","unstructured":"Mulzer, W.: Minimum dilation triangulations for the regular n-gon. Diploma Thesis. Freie universitat Berlin (2004)"},{"key":"1_CR4","first-page":"425","volume-title":"Handbook of computational Geometry","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Spanning trees and Spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of computational Geometry, pp. 425\u2013465. Elsevier, Amsterdam (1999)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-51542-9_6","volume-title":"Algorithms and Data Structures","author":"J.M. Keil","year":"1989","unstructured":"Keil, J.M., Gutwin, C.A.: The Delaunay triangulation closely approximates the complete Euclidean graph. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 47\u201356. Springer, Heidelberg (1989)"},{"key":"1_CR6","unstructured":"http:\/\/www.cs.ubc.ca\/nest\/beta\/tpsg\/"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751540_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:57:27Z","timestamp":1619492247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751540_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340706","9783540340713"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11751540_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}