{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:13:58Z","timestamp":1725542038825},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_73","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"720-729","source":"Crossref","is-referenced-by-count":5,"title":["The Directed Hausdorff Distance between Imprecise Point Sets"],"prefix":"10.1007","author":[{"given":"Christian","family":"Knauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Scherfenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wolle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H. Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Bl\u00f6mer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell.\u00a013, 251\u2013266 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"73_CR2","unstructured":"Alt, H., Guibas, L.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey. In: Handbook on Computational Geometry, pp. 251\u2013265 (1995)"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th Ann. ACM Symp. on Theory of Comp., pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S.J. Fortune","year":"1987","unstructured":"Fortune, S.J.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitchell, J.S.B., Orletsky, M.W.: Practical methods for approximate geometric pattern matching under rigid motion. In: Proc. 10th Annu. ACM Sympos. Comput. Geom, pp. 103\u2013112 (1994)","DOI":"10.1145\/177424.177572"},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0734-189X(90)90135-I","volume":"49","author":"M.T. Goodrich","year":"1990","unstructured":"Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Comput. Vision Graph. Image Process.\u00a049, 152\u2013170 (1990)","journal-title":"Comput. Vision Graph. Image Process."},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th Annu. ACM Sympos. Comput. Geom, pp. 208\u2013217 (1989)","DOI":"10.1145\/73833.73857"},{"key":"73_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0925-7721(94)90004-3","volume":"4","author":"P.J. Heffernan","year":"1994","unstructured":"Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Comput. Geom. Theory Appl.\u00a04, 137\u2013156 (1994)","journal-title":"Comput. Geom. Theory Appl."},{"key":"73_CR9","doi-asserted-by":"crossref","unstructured":"Knauer, C., L\u00f6ffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets (Preprint, 2009), http:\/\/arXiv.org\/abs\/0909.4642","DOI":"10.1007\/978-3-642-10631-6_73"},{"key":"73_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"73_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-74472-6_4","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"A. Mukhopadhyay","year":"2007","unstructured":"Mukhopadhyay, A., Greene, E., Rao, S.V.: On intersecting a set of isothetic line segments with a convex polygon of minimum area. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part I. LNCS, vol.\u00a04705, pp. 41\u201354. Springer, Heidelberg (2007)"},{"issue":"2","key":"73_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2007.08.029","volume":"105","author":"A. Mukhopadhyay","year":"2008","unstructured":"Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Proc. Let.\u00a0105(2), 58\u201364 (2008)","journal-title":"Inf. Proc. Let."},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"Nagai, T., Tokura, N.: Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. In: Japanese Conference on Discrete and Computational Geometry, pp. 252\u2013263 (2000)","DOI":"10.1007\/3-540-47738-1_24"},{"key":"73_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-73951-7_16","volume-title":"Algorithms and Data Structures","author":"M. Kreveld van","year":"2007","unstructured":"van Kreveld, M., L\u00f6ffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 446\u2013457. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:23Z","timestamp":1606185143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}