{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:57Z","timestamp":1725496017705},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_32","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T03:39:22Z","timestamp":1196048362000},"page":"388-399","source":"Crossref","is-referenced-by-count":5,"title":["Triangulations of Line Segment Sets in the Plane"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Br\u00e9villiers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Chevallier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Hackl, T.: Pre-triangulations and liftable complexes. In: Proc. 22th Annu. ACM Sympos. Comput. Geom., pp. 282\u2013291 (2006)","DOI":"10.1145\/1137856.1137899"},{"key":"32_CR2","volume-title":"Handbook of Computational Geometry","author":"F. Aurenhammer","year":"1998","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, Elsevier Science Publishers B.V, North-Holland, Amsterdam (1998)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.-Z., Kwang-Ming Hwang, F. (eds.) Computing in Euclidean Geometry, 2nd edn. Lecture Notes Series on Computing, vol.\u00a04, pp. 47\u2013123. World Scientific (1995)","DOI":"10.1142\/9789812831699_0003"},{"key":"32_CR4","unstructured":"Boissonnat, J.-D., Yvinec, M.: G\u00e9om\u00e9trie algorithmique. Ediscience international, Paris (1995)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Kedem, K.: Placing the largest similar copy of a convex polygon among polygonal obstacles. In: Proc. 5th Annu. ACM Sympos. Comput. Geom., pp. 167\u2013174 (1989)","DOI":"10.1145\/73833.73853"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl.\u00a011, 187\u2013208 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Triangulations and meshes in computational geometry. Acta Numerica, 133\u2013213 (2000)","DOI":"10.1017\/S0962492900001331"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/1247069.1247116","volume-title":"SCG 2007","author":"H. Everett","year":"2007","unstructured":"Everett, H., Lazard, S., Lazard, D., Safey El Din, M.: The voronoi diagram of three lines. In: SCG 2007. Proceedings of the twenty-third annual symposium on Computational geometry, pp. 255\u2013264. ACM Press, New York (2007)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1137\/S0097539702408387","volume":"32","author":"V. Koltum","year":"2003","unstructured":"Koltum, V., Sharir, M.: Three dimensional euclidean voronoi diagrams of lines with a fixed number of orientations. SIAM J. Comput.\u00a032(3), 616\u2013642 (2003)","journal-title":"SIAM J. Comput."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/B978-0-12-587260-7.50011-X","volume-title":"Math. Software III","author":"C.L. Lawson","year":"1977","unstructured":"Lawson, C.L.: Software for C\n                  1 surface interpolation. In: Rice, J.R. (ed.) Math. Software III, pp. 161\u2013194. Academic Press, New York (1977)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom.\u00a01, 201\u2013217 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., N\u00e4her, S., Schilz, T., Schirra, S., Seel, M., Seidel, R., Uhrig, C.: Checking geometric programs or verification of geometric structures. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 159\u2013165 (1996)","DOI":"10.1145\/237218.237344"},{"issue":"2","key":"32_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.comgeo.2004.05.003","volume":"30","author":"B. Mourrain","year":"2005","unstructured":"Mourrain, B., T\u00e9court, J.-P., Teillaud, M.: On the computation of an arrangement of quadrics in 3d. Comput. Geom. Theory Appl.\u00a030(2), 145\u2013164 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"32_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. John Wiley & Sons, Chichester (1992)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02574375","volume":"12","author":"V.T. Rajan","year":"1994","unstructured":"Rajan, V.T.: Optimality of the Delaunay triangulation in R\n                  \n                    d\n                  . Discrete Comput. Geom.\u00a012, 189\u2013202 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR16","unstructured":"Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations - a survey. Discrete Comput. Geom. ( to appear)"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/PL00009407","volume":"5","author":"D. Schmitt","year":"1999","unstructured":"Schmitt, D., Spehner, J.-C.: Angular properties of Delaunay diagrams in any dimension. Discrete Comput. Geom.\u00a05, 17\u201336 (1999)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"32_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.comgeo.2004.02.007","volume":"33","author":"E. Sch\u00f6mer","year":"2006","unstructured":"Sch\u00f6mer, E., Wolpert, N.: An exact and efficient approach for computing a cell in an arrangement of quadrics. Comput. Geom. Theory Appl.\u00a033(1\u20132), 65\u201397 (2006)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:10:32Z","timestamp":1558264232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}