{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:03:59Z","timestamp":1739250239032,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_13","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"108-119","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions"],"prefix":"10.1007","author":[{"given":"Christian","family":"Knauer","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Stehn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/B978-044482537-7\/50004-8","volume-title":"Handbook of Computational Geometry","author":"H. Alt","year":"2000","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of Computational Geometry, pp. 121\u2013153. Elsevier B.V., Amsterdam (2000)"},{"key":"13_CR2","unstructured":"Hoffmann, F., Kriegel, K., Sch\u00f6nherr, S., Wenk, C.: A Simple and Robust Geometric Algorithm for Landmark Registration in Computer Assisted Neurosurgery. Technical Report B 99-21, Freie Universit\u00e4t Berlin, Fachbereich Mathematik und Informatik, Germany (December 1999)"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/34.121791","volume":"14","author":"P.J. Besl","year":"1992","unstructured":"Besl, P.J., McKay, N.D.: A Method for Registration of 3-D Shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a014(2), 239\u2013256 (1992)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Dimitrov, D., Knauer, C., Kriegel, K.: Registration of 3D - Patterns and Shapes with Characteristic Points. In: Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2006, Set\u00fabal, Portugal, pp. 393\u2013400 (2006)","DOI":"10.5220\/0001368303930400"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dimitrov, D., Knauer, C., Kriegel, K., Stehn, F.: Approximation algorithms for a point-to-surface registration problem in medical navigation. In: Proc. Frontiers of Algorithmics Workshop, Lanzhou, China, pp. 26\u201337 (2007)","DOI":"10.1007\/978-3-540-73814-5_3"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/109648.109670","volume-title":"SCG 1991: Proceedings of the seventh annual symposium on Computational geometry","author":"D.P. Huttenlocher","year":"1991","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. In: SCG 1991: Proceedings of the seventh annual symposium on Computational geometry, pp. 194\u2013203. ACM, New York (1991)"},{"key":"13_CR7","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"M. Sharir","year":"1996","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1996)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F. Aurenhammer","year":"1984","unstructured":"Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition\u00a017(2), 251\u2013257 (1984)","journal-title":"Pattern Recognition"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(n log n) time. Inf. Process. Lett.\u00a033(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02716804","volume":"16","author":"W. Rucklidge","year":"1996","unstructured":"Rucklidge, W.: Lower Bounds for the Complexity of the Graph of the Hausdorff Distance as a Function of Transformation. Discrete & Computational Geometry\u00a016(2), 135\u2013153 (1996)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T06:32:39Z","timestamp":1739169159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}