{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:31Z","timestamp":1725485611718},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413967"},{"type":"electronic","value":"9783540444381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44438-6_30","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T18:43:17Z","timestamp":1181414597000},"page":"358-370","source":"Crossref","is-referenced-by-count":3,"title":["A New Visibility Partition for Affine Pattern Matching"],"prefix":"10.1007","author":[{"given":"Michiel","family":"Hagedoorn","sequence":"first","affiliation":[]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[]},{"given":"Remco C.","family":"Veltkamp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02574373","volume":"12","author":"P. K. Agarwal","year":"1994","unstructured":"P. K. Agarwal and M. Sharir. On the number of views of polyhedral terrains. Discrete & Computational Geometry, 12:177\u2013182, 1994. 359","journal-title":"Discrete & Computational Geometry"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"B. Aronov, L. J. Guibas, M. Teichmann, and L. Zhang. Visibility queries in simple polygons and applications. In ISAAC, pages 357\u2013366, 1998. 359","DOI":"10.1007\/3-540-49381-6_38"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai. Visibility of disjoint polygons. Algorithmica, 1:49\u201363, 1986. 359, 361","journal-title":"Algorithmica"},{"key":"30_CR4","unstructured":"P. Bose, A. Lubiw, and I. Munro. Efficient visibility queries in simple polygons. In 4th Canadian Conference on Computational Geometry, 1992. To appear in International Journal of Computational Geometry and Applications. 359"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/ima.1850020407","volume":"2","author":"K. W. Bowyer","year":"1990","unstructured":"K. W. Bowyer and C. R. Dyer. Aspect graphs: An introduction and survey of recent results. Int. J. of Imaging Systems and Technology, 2:315\u2013328, 1990. 359","journal-title":"Int. J. of Imaging Systems and Technology"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"I. Chakravarty and H. Freeman. Characteristic views as a basis for threedimensional object recognition. In Proc. SPIE: Robot Vision, pages 37\u201345, 1982. 358","DOI":"10.1117\/12.933609"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1142\/S0218195997000120","volume":"7","author":"M. Berg de","year":"1997","unstructured":"M. de Berg, D. Halperin, M. H. Overmars, and M. van Kreveld. Sparse arrangements and the number of views of polyhedral scenes. Int. J. Computational Geometry & Applications, 7(3):175\u2013195, 1997. 359","journal-title":"Int. J. Computational Geometry & Applications"},{"key":"30_CR8","unstructured":"H. Everett. Visibility graph recognition. PhD thesis, Department of Computer Science, University of Toronto, 1990. 359"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02770871","volume":"17","author":"S. K. Ghosh","year":"1997","unstructured":"S. K. Ghosh. On recognizing and characterizing visibility graphs of simple polygons. Discrete & Computational Geometry, 17(2):143\u2013162, 1997. 359","journal-title":"Discrete & Computational Geometry"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S. K. Ghosh","year":"1991","unstructured":"S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs. SIAM Journal on Computing, 20:888\u2013910, 1991. 364","journal-title":"SIAM Journal on Computing"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/34.87341","volume":"13","author":"Z. Gigus","year":"1991","unstructured":"Z. Gigus, J. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:542\u2013551, 1991. 359","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"30_CR12","unstructured":"N. Grimal, J. Hallof, and D. van der Plas. Hieroglyphica, sign list. \n http:\/\/www.ccer.theo.uu.nl\/hiero\/hiero.html\n \n , 1993. 360"},{"issue":"4","key":"30_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0097539792233257","volume":"26","author":"L. J. Guibas","year":"1997","unstructured":"L. J. Guibas, Rajeev Motwani, and Prabhakar Raghavan. The robot localisation problem. SIAM J. Computing, 26(4), 1997. 359","journal-title":"SIAM J. Computing"},{"key":"30_CR14","unstructured":"M. Hagedoorn. Pattern matching using similarity measures PhD thesis, Department of Computer Science, Utrecht University, ISBN90-393-2460-3, 2000. 359"},{"key":"30_CR15","unstructured":"M. Hagedoorn, M. H. Overmars, and R. C. Veltkamp. New visibility partitions with applications in affine pattern matching. Technical Report UU-CS-1999-21, Utrecht University, Padualaan 14, 3584 CH Utrecht, the Netherlands, July 1999. \n http:\/\/www.cs.uu.nl\/docs\/research\/publication\/TechRep.html\n \n . 364, 365, 367"},{"key":"30_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-49126-0_22","volume-title":"Discrete Geometry for Computer Imagery","author":"M. Hagedoorn","year":"1999","unstructured":"M. Hagedoorn and R. C. Veltkamp. Measuring resemblance of complex patterns. In L. Perroton G. Bertrand, M. Couprie, editor, Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science 1568, pages 286\u2013298, 1999. Springer. 359, 367"},{"key":"30_CR17","first-page":"119","volume":"5","author":"D. J. Kriegman","year":"1990","unstructured":"D. J. Kriegman and J. Ponce. Computing exact aspect graphs of curved objects: Solids of revolution. ACM Symp. Computational Geometry, 5:119\u2013135, 1990. 359","journal-title":"Computing exact aspect graphs of curved objects: Solids of revolution"},{"key":"30_CR18","unstructured":"D. T. Lee. Proximity and Reachability in the plane. PhD thesis, University of Illinois at Urbana-Champaign, 1978. 358"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/S0218195995000179","volume":"5","author":"Y. Lin","year":"1995","unstructured":"Y. Lin and S. S. Skiena. Complexity aspects of visibility graphs. International Journal of Computational Geometry and Applications, 5:289\u2013312, 1995. 359","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"30_CR20","unstructured":"K. Mulmuley. Computational Geometry: An introduction through randomized algorithms. Prentice Hall, 1994. 361, 364"},{"issue":"2","key":"30_CR21","first-page":"137","volume":"5","author":"W. H. Plantinga","year":"1990","unstructured":"W. H. Plantinga and C. R. Dyer. Visibility, occlusion and the aspect graph. ACM Symp. Computational Geometry, 5(2):137\u2013160, 1990. 359","journal-title":"ACM Symp. Computational Geometry"},{"issue":"4","key":"30_CR22","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M. Pocchiola","year":"1996","unstructured":"M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudotriangulations. Discrete & Computational Geometry, 16(4):419\u2013453, 1996. 359, 364","journal-title":"Discrete & Computational Geometry"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"E. Welzl. Constructing the visibility graph for n-line segments in O(n2) time. Inform. Process. Lett., 20:167\u2013171, 1985. 359","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44438-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T08:26:53Z","timestamp":1550392013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44438-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413967","9783540444381"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44438-6_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}