{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:54Z","timestamp":1725643554713},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_29","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"296-307","source":"Crossref","is-referenced-by-count":0,"title":["Triangulations with Circular Arcs"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Aigner","sequence":"additional","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"Kate\u0159ina","family":"\u010cech Dobi\u00e1\u0161ov\u00e1","sequence":"additional","affiliation":[]},{"given":"Bert","family":"J\u00fcttler","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Aichholzer, O., Aigner, W., Aurenhammer, F., \u010cech Dobi\u00e1\u0161ov\u00e1, K., J\u00fcttler, B.: Arc triangulations. In: Proc. 26th European Workshop Comput. Geometry, pp. 17\u201320 (2010)"},{"key":"29_CR2","unstructured":"Aichholzer, O., Rote, G., Schulz, A., Vogtenhuber, B.: Pointed drawings of planar graphs. In: Proc. 19th Ann. Canadian Conf. Comput. Geometry, pp. 237\u2013240 (2007)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1142\/S0218195911003548","volume":"21","author":"O. Aichholzer","year":"2011","unstructured":"Aichholzer, O., Aurenhammer, F., Hackl, T., Juettler, B., Oberneder, M., Sir, Z.: Computational and structural advantages of circular boundary representation. Int\u2019l J. Computational Geometry & Applications\u00a021, 47\u201369 (2011)","journal-title":"Int\u2019l J. Computational Geometry & Applications"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. Computing in Euclidean Geometry. LN Series on Computing, vol.\u00a04, pp. 47\u2013123. World Scientific (1995)","DOI":"10.1142\/9789812831699_0003"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1002\/nme.542","volume":"55","author":"C. Boivin","year":"2002","unstructured":"Boivin, C., Ollivier-Gooch, C.: Guaranteed-quality triangular mesh generation for domains with curved boundaries. International Journal for Numerical Methods in Engineering\u00a055, 1185\u20131213 (2002)","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(91)90018-K","volume":"10","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E., Rendl, F.: Lexicographic bottleneck problems. Operations Research Letters\u00a010, 303\u2013308 (1991)","journal-title":"Operations Research Letters"},{"key":"29_CR7","unstructured":"Carr\u00e9, B.: Graphs and networks. Oxford University Press (1979)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-46648-7_12","volume-title":"Graph Drawing","author":"C.C. Cheng","year":"1999","unstructured":"Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing Planar Graphs With Circular Arcs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 117\u2013126. Springer, Heidelberg (1999)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: Constrained Delaunay triangulations. Algorithmica\u00a04, 97\u2013108 (1989)","journal-title":"Algorithmica"},{"key":"29_CR10","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing\u2014Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G.D. Battista Di","year":"1996","unstructured":"Di Battista, G.D., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Mathematics\u00a09, 349\u2013359 (1996)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-18469-7_18","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi Drawings of Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 195\u2013207. Springer, Heidelberg (2011)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(89)90133-3","volume":"66","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Rote, G., Welzl, E.: Testing the necklace condition for shortest tours and optimal factors in the plane. Theor. Comput. Sci.\u00a066, 157\u2013180 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.7155\/jgaa.00140","volume":"11","author":"A. Efrat","year":"2007","unstructured":"Efrat, A., Erten, C., Kobourov, S.G.: Fixed-Location Circular-Arc Drawing of Planar Graphs. Journal of Graph Algorithms and Applications\u00a011, 145\u2013164 (2007)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinar Graph Drawing Using The Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M. Formann","year":"1993","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., W\u00f6ginger, G.: Drawing graphs in the plane with high resolution. SIAM J. Computing\u00a022, 1035\u20131052 (1993)","journal-title":"SIAM J. Computing"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. Computing in Euclidean Geometry. LN Series on Computing, vol.\u00a04, pp. 225\u2013265. World Scientific (1995)","DOI":"10.1142\/9789812831699_0007"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jagm.2000.1115","volume":"37","author":"M.I. Goodrich","year":"2000","unstructured":"Goodrich, M.I., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. J. Algorithms\u00a037, 399\u2013421 (2000)","journal-title":"J. Algorithms"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90078-X","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics\u00a023, 309\u2013311 (1978)","journal-title":"Discrete Mathematics"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Lloyd, E.L.: On triangulations of a set of points in the plane. In: Proc. 18th IEEE Symp. on Foundations of Computer Science, pp. 228\u2013240 (1977)","DOI":"10.1109\/SFCS.1977.21"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. In: Proc. 24th Ann., pp. 527\u2013538 (1992)","DOI":"10.1145\/129712.129764"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0377-2217(92)90347-C","volume":"57","author":"E. Marchi","year":"1992","unstructured":"Marchi, E., Oviedo, J.A.: Lexicographic optimality in the multiple objective linear programming: The nucleolar solution. European Journal of Operational Research\u00a057, 355\u2013359 (1992)","journal-title":"European Journal of Operational Research"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar graph drawing. World Scientific (2004)","DOI":"10.1142\/5648"},{"key":"29_CR24","unstructured":"Pedoe, D.: A course of geometry for colleges and universities. Cambridge University Press (1970)"},{"key":"29_CR25","unstructured":"Rote, G.: Two solvable cases of the traveling salesman problem. PhD Thesis, TU Graz, Institute for Mathematics (1988)"},{"key":"29_CR26","unstructured":"Shewchuk, J.: What is a good linear element? Interpolation, conditioning, and quality measures. In: Proc. 11th International Meshing Roundtable, pp. 115\u2013126 (2002)"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"Shostak, R.: Deciding linear inequalities by computing loop residues. Journal of the ACM\u00a028, 769\u2013779 (1981)","journal-title":"Journal of the ACM"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowledge Engineers. World Scientific (2002)","DOI":"10.1142\/4902"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:29:35Z","timestamp":1561058975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}