{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:29Z","timestamp":1760440949695,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_25","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"266-278","source":"Crossref","is-referenced-by-count":35,"title":["Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-14165-2_3","volume-title":"Proc. 37th Int. Colloquium on Automata, Languages and Programming, ICALP 2010","author":"N. Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane Spanners of Maximum Degree Six. In: Gavoille, C. (ed.) ICALP 2010. LNCS, vol.\u00a06198, pp. 19\u201330. Springer, Heidelberg (2010)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/978-3-540-92182-0_58","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2008","unstructured":"Bose, P., Carmi, P., Collette, S., Smid, M.: On the Stretch Factor of Convex Delaunay Graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 656\u2013667. Springer, Heidelberg (2008)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69903-3_33","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"P. Bose","year":"2008","unstructured":"Bose, P., Carmi, P., Couture, M.: Spanners of Additively Weighted Point Sets. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 367\u2013377. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Smid, M.H.M., Wuhrer, S.: Pi\/2-Angle Yao Graphs are Spanners. CoRR abs\/1001.2913 (2010)","key":"25_CR4","DOI":"10.1007\/978-3-642-17514-5_38"},{"unstructured":"Bose, P., Devroye, L., L\u00f6ffler, M., Snoeyink, J., Verma, V.: The spanning ratio of the Delaunay triangulation is greater than \u03c0\/2. In: Proc. of 21st Canadian Conf. on Computational Geometry, CCCG 2009 (2009)","key":"25_CR5"},{"unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems (2009) (submitted)","key":"25_CR6"},{"issue":"2","key":"25_CR7","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(2), 205\u2013219 (1989)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Chew, P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: Proc. 1st Ann. Symp. on Computational Geometry, SCG 1985, pp. 235\u2013244 (1985)","key":"25_CR8","DOI":"10.1145\/323233.323264"},{"doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proc. 19th Ann. ACM Symp. on Theory of Computing, STOC 1987, pp. 56\u201365 (1987)","key":"25_CR9","DOI":"10.1145\/28395.28402"},{"issue":"1-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0012-365X(95)00276-3","volume":"161","author":"M.B. Dillencourt","year":"1996","unstructured":"Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and Delaunay realizability. Discrete Mathematics\u00a0161(1-3), 63\u201377 (1996)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Toughness and Delaunay Triangulations. Discrete and Computational Geometry\u00a05(1), 575\u2013601 (1990)","journal-title":"Discrete and Computational Geometry"},{"issue":"4","key":"25_CR12","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 & Computational Geometry\u00a05(4), 399\u2013407 (1990)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.comgeo.2005.07.004","volume":"36","author":"A. Dumitrescu","year":"2007","unstructured":"Dumitrescu, A., Ebbers-Baumann, A., Grne, A., Klein, R., Rote, G.: On the geometric dilation of closed curves, graphs, and point sets. Computational Geometry: Theory and Applications\u00a036(1), 16\u201338 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"doi-asserted-by":"crossref","unstructured":"Felsner, S.: Geometric graphs and arrangements. Vieweg (2004)","key":"25_CR14","DOI":"10.1007\/978-3-322-80303-0"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S. Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder Woods and Orthogonal Surfaces. Discrete and Computational Geometry\u00a040(1), 103\u2013126 (2008)","journal-title":"Discrete and Computational Geometry"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/3-540-68530-8_14","volume-title":"Algorithms - ESA \u201998","author":"M. Fischer","year":"1998","unstructured":"Fischer, M., Lukovszki, T., Ziegler, M.: Geometric searching in walkthrough animations with weak spanners in real time. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 163\u2013174. Springer, Heidelberg (1998)"},{"volume-title":"Handbook of discrete and computational geometry","year":"1997","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of discrete and computational geometry. CRC Press, Inc., Boca Raton (1997)","key":"25_CR17"},{"issue":"4","key":"25_CR18","first-page":"627","volume":"E83-A","author":"T. Hiroshima","year":"2000","unstructured":"Hiroshima, T., Miyamoto, Y., Sugihara, K.: Another Proof of Polynomial-Time Recognizability of Delaunay Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E83-A(4), 627\u2013638 (2000)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"3","key":"25_CR19","first-page":"251","volume":"27","author":"C.D. Hodgson","year":"1992","unstructured":"Hodgson, C.D., Rivin, I., Smith, W.D.: A Characterization of Convex Hyperbolic Polyhedra and of Convex Polyhedra Inscribed in the Sphere. Bulletin of the American Mathematical Society\u00a027(3), 251\u2013256 (1992)","journal-title":"Bulletin of the American Mathematical Society"},{"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: Proc. 26th Ann. Conf. on Comp. Graphics and Interactive Techniques, SIGGRAPH 1999, pp. 277\u2013286 (1999)","key":"25_CR20","DOI":"10.1145\/311535.311567"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/3-540-45749-6_52","volume-title":"Algorithms - ESA 2002","author":"M.I. Karavelas","year":"2002","unstructured":"Karavelas, M.I., Yvinec, M.: Dynamic Additively Weighted Voronoi Diagrams in 2D. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 586\u2013598. Springer, Heidelberg (2002)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT \u201988","author":"J.M. Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 208\u2013213. Springer, Heidelberg (1988)"},{"issue":"1","key":"25_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry\u00a07(1), 13\u201328 (1992)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D.T. Lee","year":"1981","unstructured":"Lee, D.T., Drysdale, R.L.: Generalization of Voronoi Diagrams in the Plane. SIAM Journal on Computing\u00a010(1), 73\u201387 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63938-1_45","volume-title":"Graph Drawing","author":"W. Lenhart","year":"1997","unstructured":"Lenhart, W., Liotta, G.: Drawable and forbidden minimum weight triangulations. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 1\u201312. Springer, Heidelberg (1997)"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-68552-4_6","volume-title":"Experimental Algorithms","author":"K.M. Lillis","year":"2008","unstructured":"Lillis, K.M., Pemmaraju, S.V.: On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 69\u201386. Springer, Heidelberg (2008)"},{"key":"25_CR27","doi-asserted-by":"crossref","first-page":"43","DOI":"10.4171\/dm\/117","volume":"7","author":"E. Miller","year":"2002","unstructured":"Miller, E.: Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals. Documenta Mathematica\u00a07, 43\u201390 (2002)","journal-title":"Documenta Mathematica"},{"key":"25_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"unstructured":"O\u2019Rourke, J.: The Yao Graph Y 6 is a Spanner. CoRR abs\/1003.3713 (2010)","key":"25_CR29"},{"doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","key":"25_CR30","DOI":"10.1137\/1.9780898719772"},{"issue":"4","key":"25_CR31","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM Journal on Computing\u00a018(4), 740\u2013747 (1989)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: 3rd Canadian Conference on Computational Geometry (CCCG), pp. 207\u2013210 (1991)","key":"25_CR32"},{"key":"25_CR33","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar Graphs and Poset Dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"issue":"4","key":"25_CR34","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A.C.C. Yao","year":"1982","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing\u00a011(4), 721\u2013736 (1982)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T04:54:44Z","timestamp":1685854484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}