{"id":"https://openalex.org/W1613765651","doi":"https://doi.org/10.1007/s10044-008-0133-y","title":"Speeding up simplification of polygonal curves using nested approximations","display_name":"Speeding up simplification of polygonal curves using nested approximations","publication_year":2008,"publication_date":"2008-08-06","ids":{"openalex":"https://openalex.org/W1613765651","doi":"https://doi.org/10.1007/s10044-008-0133-y","mag":"1613765651"},"language":"en","primary_location":{"id":"doi:10.1007/s10044-008-0133-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10044-008-0133-y","pdf_url":null,"source":{"id":"https://openalex.org/S45497385","display_name":"Pattern Analysis and Applications","issn_l":"1433-7541","issn":["1433-7541","1433-755X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0709.1941","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"P. F. Marteau","orcid":null},"institutions":[{"id":"https://openalex.org/I2802204017","display_name":"Universit\u00e9 de Bretagne Sud","ror":"https://ror.org/04ed7fw48","country_code":"FR","type":"education","lineage":["https://openalex.org/I2802204017"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"P. F. Marteau","raw_affiliation_strings":["VALORIA, Universit\u00e9 Europ\u00e9nne de Bretagne, Universit\u00e9 de Bretagne Sud, BP573, 56017, Vannes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VALORIA, Universit\u00e9 Europ\u00e9nne de Bretagne, Universit\u00e9 de Bretagne Sud, BP573, 56017, Vannes, France","institution_ids":["https://openalex.org/I2802204017"]}]},{"author_position":"last","author":{"id":null,"display_name":"G. M\u00e9nier","orcid":null},"institutions":[{"id":"https://openalex.org/I2802204017","display_name":"Universit\u00e9 de Bretagne Sud","ror":"https://ror.org/04ed7fw48","country_code":"FR","type":"education","lineage":["https://openalex.org/I2802204017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"G. M\u00e9nier","raw_affiliation_strings":["VALORIA, Universit\u00e9 Europ\u00e9nne de Bretagne, Universit\u00e9 de Bretagne Sud, BP573, 56017, Vannes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VALORIA, Universit\u00e9 Europ\u00e9nne de Bretagne, Universit\u00e9 de Bretagne Sud, BP573, 56017, Vannes, France","institution_ids":["https://openalex.org/I2802204017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2802204017"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.4891,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85578987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"4","first_page":"367","last_page":"375"},"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.680400013923645,"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.680400013923645,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.14169999957084656,"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/T10799","display_name":"Data Visualization and Analytics","score":0.0333000011742115,"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/polygonal-chain","display_name":"Polygonal chain","score":0.7847999930381775},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5389000177383423},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5049999952316284},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4415999948978424},{"id":"https://openalex.org/keywords/multiresolution-analysis","display_name":"Multiresolution analysis","score":0.39590001106262207},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.3813000023365021}],"concepts":[{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.7847999930381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5891000032424927},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.508400022983551},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5049999952316284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4131999909877777},{"id":"https://openalex.org/C121927907","wikidata":"https://www.wikidata.org/wiki/Q1952516","display_name":"Multiresolution analysis","level":5,"score":0.39590001106262207},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3328000009059906},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2874999940395355}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10044-008-0133-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10044-008-0133-y","pdf_url":null,"source":{"id":"https://openalex.org/S45497385","display_name":"Pattern Analysis and Applications","issn_l":"1433-7541","issn":["1433-7541","1433-755X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0709.1941","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0709.1941","pdf_url":"https://arxiv.org/pdf/0709.1941","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-00171706v3","is_oa":false,"landing_page_url":"https://hal.science/hal-00171706","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pattern Analysis and Applications, 2008, pp.1-8. ⟨10.1007/s10044-008-0133-y⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0709.1941","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0709.1941","pdf_url":"https://arxiv.org/pdf/0709.1941","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1561671573","https://openalex.org/W1583348561","https://openalex.org/W1981934656","https://openalex.org/W1983579396","https://openalex.org/W1990290671","https://openalex.org/W2006609100","https://openalex.org/W2008987433","https://openalex.org/W2029912643","https://openalex.org/W2030025777","https://openalex.org/W2063349265","https://openalex.org/W2076627497","https://openalex.org/W2090451920","https://openalex.org/W2101642354","https://openalex.org/W2123630097","https://openalex.org/W2136504711","https://openalex.org/W2142044711","https://openalex.org/W2143325592","https://openalex.org/W2146628471","https://openalex.org/W4240006403","https://openalex.org/W4251696430"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2016-06-24T00:00:00"}