{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:35Z","timestamp":1725564635911},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229452"},{"type":"electronic","value":"9783540286493"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28649-3_46","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:31:41Z","timestamp":1283974301000},"page":"375-382","source":"Crossref","is-referenced-by-count":1,"title":["Fast Statistically Geometric Reasoning About Uncertain Line Segments in 2D- and 3D-Space"],"prefix":"10.1007","author":[{"given":"Christian","family":"Beder","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica\u00a01, 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"key":"46_CR2","unstructured":"Beder, C.: Joinalgorithmus f\u00fcr Mengen unsicherer geometrischer Elemente. Technical report, Institut f\u00fcr Photogrammetrie (2003)"},{"key":"46_CR3","unstructured":"Beder, C.: A unified framework for the automatic matching of points and lines in multiple oriented images. In: Proc. 20th ISPRS Congress, Istanbul, Turkey (2004)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad trees: A data structure for retrieval on composite keys. Acta Informatica\u00a04, 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Brunn, A., F\u00f6rstner, W.: S. Heuel. Statistically testing uncertain geometric relations. In: Proc. DAGM 2000, Kiel, Germany, pp. 17\u201326 (2000)","DOI":"10.1007\/978-3-642-59802-9_3"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45404-7_13","volume-title":"Pattern Recognition","author":"S. Heuel","year":"2001","unstructured":"Heuel, S.: Points, lines and planes and their optimal estimation. In: Radig, B., Florczyk, S. (eds.) DAGM 2001. LNCS, vol.\u00a02191, pp. 92\u201399. Springer, Heidelberg (2001)"},{"key":"46_CR8","volume-title":"CVPR 2001","author":"S. Heuel","year":"2001","unstructured":"Heuel, S., F\u00f6rstner, W.: Matching, reconstructing and grouping 3d lines from multiple views using uncertain projective geometry. In: CVPR 2001, IEEE, Los Alamitos (2001)"},{"key":"46_CR9","unstructured":"Jung, F., Paparoditis, N.: Extracting 3d free-form surface boundaries of manmade objects from multiple calibrated images: A robust, accurate and high resolving power edgel matching and chaining approach. In: Proc. of the ISPRS Conf. Photogrammetric Image Analysis, pp. 39\u201344 (2003)"},{"key":"46_CR10","series-title":"The Art of Computer Programming","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1998)"},{"key":"46_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2551-2","volume-title":"Perceptual Organization and Visual Recognition","author":"D.G. Lowe","year":"1985","unstructured":"Lowe, D.G.: Perceptual Organization and Visual Recognition. Kluwer Academic Publishers, Dordrecht (1985)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Schneider, R., Seeger, R., Beckmann, N., Kriegel, H.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD Symposium on Principles of Database Systems, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"46_CR13","volume-title":"Oriented Projective Geometry","author":"J. Stolfi","year":"1991","unstructured":"Stolfi, J.: Oriented Projective Geometry. Academic Press, London (1991)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28649-3_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:27:51Z","timestamp":1605760071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28649-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229452","9783540286493"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28649-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}