{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:22Z","timestamp":1725489802560},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_40","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"458-469","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing Maximal Angles for Plane Straight-Line Graphs"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Clemens","family":"Huemer","sequence":"additional","affiliation":[]},{"given":"Attila","family":"P\u00f3r","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Santos","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","unstructured":"Aichholzer, O., Hackl, T., Hoffmann, M., Huemer, C., Santos, F., Speckmann, B., Vogtenhuber, B.: Maximizing Maximal Angles for Plane Straight Line Graphs - Extended Abstract. In: Abstracts 23rd European Workshop Comput. Geom., pp. 98\u2013101 (2007)"},{"key":"40_CR2","first-page":"160","volume":"4","author":"F. Aurenhammer","year":"2000","unstructured":"Aurenhammer, F., Xu, Y.-F.: Optimal Triangulations. Encyclopedia of Optimization\u00a04, 160\u2013166 (2000)","journal-title":"Encyclopedia of Optimization"},{"issue":"6","key":"40_CR3","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1137\/S0097539702411368","volume":"32","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H., Brass, P.: Pseudo-Triangulations from Surfaces and a Novel Type of Edge Flip. SIAM J. Comput.\u00a032(6), 1621\u20131653 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0097539796312721","volume":"29","author":"A. Aggarwal","year":"1999","unstructured":"Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The Angular-Metric Traveling Salesman Problem. SIAM J. Comput.\u00a029(3), 697\u2013711 (1999)","journal-title":"SIAM J. Comput."},{"key":"40_CR5","volume-title":"Discrete and Computational Geometry: The Goodman-Pollack Festschrift","author":"E. Arkin","year":"2003","unstructured":"Arkin, E., Fekete, S., Hurtado, F., Mitchell, J., Noy, M., Sacrist\u00e1n, V., Sethia, S.: On the Reflexivity of Point Sets. In: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, Springer, Heidelberg (2003)"},{"key":"40_CR6","unstructured":"B\u00e1r\u00e1ny, I., P\u00f3r, A., Valtr, P.: Paths with no Small Angles. Manuscript in preparation (2006)"},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(05)80059-5","volume":"48","author":"M. Bern","year":"1994","unstructured":"Bern, M., Eppstein, D., Gilbert, J.: Provably Good Mesh Generation. J. Comput. Syst. Sci.\u00a048(3), 384\u2013409 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-2","key":"40_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0925-7721(00)00016-X","volume":"17","author":"Y. Dai","year":"2000","unstructured":"Dai, Y., Katoh, N., Cheng, S.-W.: LMT-Skeleton Heuristics for Several New Classes of Optimal Triangulations. Comput. Geom. Theory Appl.\u00a017(1-2), 51\u201368 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"40_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(92)90013-I","volume":"1","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D.: The Farthest Point Delaunay Triangulation Minimizes Angles. Comput. Geom. Theory Appl.\u00a01(3), 143\u2013148 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"40_CR10","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0913058","volume":"13","author":"H. Edelsbrunner","year":"1992","unstructured":"Edelsbrunner, H., Tan, T.S., Waupotitsch, R.: An O(n\n                  2 logn) Time Algorithm for the Minmax Angle Triangulation. SIAM J. Sci. Stat. Comput.\u00a013(4), 994\u20131008 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"40_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-Restricted Tours in the Plane. Comput. Geom. Theory Appl.\u00a08(4), 195\u2013218 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1-2","key":"40_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.comgeo.2004.07.003","volume":"31","author":"R. Haas","year":"2005","unstructured":"Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D., Streinu, I., Whiteley, W.: Planar Minimally Rigid Graphs and Pseudo-Triangulations. Comput. Geom. Theory Appl.\u00a031(1-2), 31\u201361 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1-2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0218195902000724","volume":"12","author":"D. Kirkpatrick","year":"2002","unstructured":"Kirkpatrick, D., Snoeyink, J., Speckmann, B.: Kinetic Collision Detection for Simple Polygons. Internat. J. Comput. Geom. Appl.\u00a012(1-2), 3\u201327 (2002)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"40_CR14","unstructured":"Keil, J.M., Vassilev, T.S.: The Relative Neighbourhood Graph is a Part of Every 30deg-Triangulation. Abstracts 21st European Workshop Comput. Geom., pp. 9\u201312 (2005)"},{"key":"40_CR15","unstructured":"Rote, G., Santos, F., Streinu, I.: Pseudo-Triangulations \u2013 a Survey. Manuscript (2006), \n                    \n                      http:\/\/arxiv.org\/abs\/math\/0612672"},{"issue":"4","key":"40_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00454-005-1184-0","volume":"34","author":"I. Streinu","year":"2005","unstructured":"Streinu, I.: Pseudo-Triangulations, Rigidity and Motion Planning. Discrete Comput. Geom.\u00a034(4), 587\u2013635 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR17","unstructured":"Vogtenhuber, B.: On Plane Straight Line Graphs. Master\u2019s Thesis, Graz University of Technology, Graz, Austria (January 2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:59Z","timestamp":1619517959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}