{"id":"https://openalex.org/W1557773250","doi":"https://doi.org/10.1007/978-3-540-69507-3_17","title":"Fast Approximate Point Set Matching for Information Retrieval","display_name":"Fast Approximate Point Set Matching for Information Retrieval","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1557773250","doi":"https://doi.org/10.1007/978-3-540-69507-3_17","mag":"1557773250"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-69507-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69507-3_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011337679","display_name":"Rapha\u00ebl Clifford","orcid":"https://orcid.org/0000-0003-0599-0915"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rapha\u00ebl Clifford","raw_affiliation_strings":["University of Bristol, Department of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","University of Bristol, Dept. of Computer Science, Woodland Road, Bristol, BS8 1UB, UK"],"affiliations":[{"raw_affiliation_string":"University of Bristol, Department of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"University of Bristol, Dept. of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035485534","display_name":"Benjamin Sach","orcid":"https://orcid.org/0000-0001-8360-9345"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Benjamin Sach","raw_affiliation_strings":["University of Bristol, Department of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","University of Bristol, Dept. of Computer Science, Woodland Road, Bristol, BS8 1UB, UK"],"affiliations":[{"raw_affiliation_string":"University of Bristol, Department of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"University of Bristol, Dept. of Computer Science, Woodland Road, Bristol, BS8 1UB, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011337679"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13545151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6883585453033447},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6800205111503601},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6800037622451782},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6435798406600952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5675899982452393},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5661747455596924},{"id":"https://openalex.org/keywords/point-set-registration","display_name":"Point set registration","score":0.5092469453811646},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.5088325142860413},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4775603413581848},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32687443494796753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22780334949493408},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14725419878959656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.12714150547981262},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0626327395439148}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6883585453033447},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6800205111503601},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6800037622451782},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6435798406600952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5675899982452393},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5661747455596924},{"id":"https://openalex.org/C200336642","wikidata":"https://www.wikidata.org/wiki/Q15058706","display_name":"Point set registration","level":3,"score":0.5092469453811646},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.5088325142860413},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4775603413581848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32687443494796753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22780334949493408},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14725419878959656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12714150547981262},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0626327395439148},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-540-69507-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69507-3_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.103.3563","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.3563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/~aram/theory/ben.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/58be608e-88ba-42fe-88df-aa4f32adc2b2","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/58be608e-88ba-42fe-88df-aa4f32adc2b2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Clifford, R & Sach, B 2007, Fast Approximate Point Set Matching for Information Retrieval. in SOFSEM 2007: Theory and Practice of Computer Science : 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007. Proceedings. Lecture Notes in Computer Science, vol. 4362, Springer Berlin Heidelberg, pp. 212-223. https://doi.org/10.1007/978-3-540-69507-3_17","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/58be608e-88ba-42fe-88df-aa4f32adc2b2","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/58be608e-88ba-42fe-88df-aa4f32adc2b2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Clifford, R & Sach, B 2007, Fast Approximate Point Set Matching for Information Retrieval. in SOFSEM 2007: Theory and Practice of Computer Science : 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007. Proceedings. Lecture Notes in Computer Science, vol. 4362, Springer Berlin Heidelberg, pp. 212-223. https://doi.org/10.1007/978-3-540-69507-3_17","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1506420422","https://openalex.org/W1674505027","https://openalex.org/W1996113955","https://openalex.org/W2102182691","https://openalex.org/W2113692647","https://openalex.org/W2123555133","https://openalex.org/W2752885492","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2943461603","https://openalex.org/W3210429500","https://openalex.org/W3217252310","https://openalex.org/W4286894112","https://openalex.org/W68787175","https://openalex.org/W2359134215","https://openalex.org/W2343272898","https://openalex.org/W1182131121","https://openalex.org/W2010851067","https://openalex.org/W68135438"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}