{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:27Z","timestamp":1725500727516},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_4","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"17-28","source":"Crossref","is-referenced-by-count":1,"title":["Fixed-Orientation Equilateral Triangle Matching of Point Sets"],"prefix":"10.1007","author":[{"given":"Jasine","family":"Babu","sequence":"first","affiliation":[]},{"given":"Ahmad","family":"Biniaz","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00454-008-9099-1","volume":"41","author":"B.M. \u00c1brego","year":"2009","unstructured":"\u00c1brego, B.M., Arkin, E., Fern\u00e1ndez-Merchant, S., Hurtado, F., Kano, M., Mitchell, J., Urrutia, J.: Matching points with squares. Discrete and Computational Geometry\u00a041, 77\u201395 (2009)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR2","unstructured":"Babu, J., Biniaz, A., Maheshwari, A., Smid, M.: Fixed-orientation equilateral triangle matching of point sets. CoRR abs\/1211.2734 (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1211.2734"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.comgeo.2008.05.001","volume":"42","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., Mutsanas, N., Wolff, A.: Matching points with rectangles and squares. Comput. Geom. Theory Appl.\u00a042(2), 93\u2013108 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 266\u2013278. Springer, Heidelberg (2010)"},{"key":"4_CR5","first-page":"41","volume":"1","author":"P. Bose","year":"2010","unstructured":"Bose, P., Carmi, P., Collette, S., Smid, M.: On the stretch factor of convex Delaunay graphs. Journal of Computational Geometry\u00a01, 41\u201356 (2010)","journal-title":"Journal of Computational Geometry"},{"issue":"2","key":"4_CR6","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"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 56\u201365. ACM (1987)","DOI":"10.1145\/28395.28402"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Dillencourt, M.: Toughness and Delaunay triangulations. In: Proceedings of the Third Annual Symposium on Computational Geometry, SCG 1987, pp. 186\u2013194. ACM (1987)","DOI":"10.1145\/41958.41978"},{"key":"4_CR10","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)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546884"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T. Nishizeki","year":"1979","unstructured":"Nishizeki, T.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Mathematics\u00a028, 255\u2013267 (1979)","journal-title":"Discrete Mathematics"},{"key":"4_CR13","unstructured":"Panahi, F., Mohades, A., Davoodi, M., Eskandari, M.: Weak matching points with triangles. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry (2011)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:35:03Z","timestamp":1620135303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}