{"id":"https://openalex.org/W3023761765","doi":"https://doi.org/10.20382/jocg.v11i1a1","title":"On optimal polyline simplification using the Hausdorff and Fr\u00e9chet distance","display_name":"On optimal polyline simplification using the Hausdorff and Fr\u00e9chet distance","publication_year":2018,"publication_date":"2018-10-29","ids":{"openalex":"https://openalex.org/W3023761765","doi":"https://doi.org/10.20382/jocg.v11i1a1","mag":"3023761765"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3091","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3091","pdf_url":"https://jocg.org/index.php/jocg/article/view/3091","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 1 (2020); 1\u201325","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/3091","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053874521","display_name":"Marc van Kreveld","orcid":"https://orcid.org/0000-0001-8208-3468"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Van Kreveld, Marc","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112453554","display_name":"Maarten L\u00f6ffler","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"L\u00f6ffler, Maarten","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048954383","display_name":"Lionov Wiratma","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wiratma, Lionov","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.9941,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.90216787,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"25"},"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.954800009727478,"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.954800009727478,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9401999711990356,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8146847486495972},{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.8094197511672974},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7356236577033997},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6624634265899658},{"id":"https://openalex.org/keywords/hausdorff-space","display_name":"Hausdorff space","score":0.5809230804443359},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5787364840507507},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5774692893028259},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44179767370224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4314999580383301},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1291525959968567},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07908499240875244}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8146847486495972},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.8094197511672974},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7356236577033997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6624634265899658},{"id":"https://openalex.org/C191399826","wikidata":"https://www.wikidata.org/wiki/Q326908","display_name":"Hausdorff space","level":2,"score":0.5809230804443359},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5787364840507507},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5774692893028259},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44179767370224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4314999580383301},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1291525959968567},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07908499240875244},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/3091","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3091","pdf_url":"https://jocg.org/index.php/jocg/article/view/3091","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 1 (2020); 1\u201325","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:d2cb71dbe87644d58aecabc1e9d88993","is_oa":true,"landing_page_url":"https://doaj.org/article/d2cb71dbe87644d58aecabc1e9d88993","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 11, Iss 1 (2020)","raw_type":"article"},{"id":"mag:3023761765","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1803.03550.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.20382/jocg.v11i1a1","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v11i1a1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3091","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3091","pdf_url":"https://jocg.org/index.php/jocg/article/view/3091","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 1 (2020); 1\u201325","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3023761765.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2963946018","https://openalex.org/W2790091875","https://openalex.org/W2963822537","https://openalex.org/W2976149974","https://openalex.org/W2143009348","https://openalex.org/W2264989043","https://openalex.org/W1986116224","https://openalex.org/W2021784334","https://openalex.org/W2083364906","https://openalex.org/W2136807817","https://openalex.org/W2138661093","https://openalex.org/W2490687350","https://openalex.org/W2468249072","https://openalex.org/W2727916167","https://openalex.org/W2537342248","https://openalex.org/W1984610405","https://openalex.org/W3021886364","https://openalex.org/W2987386832","https://openalex.org/W2120322494","https://openalex.org/W3184650363"],"abstract_inverted_index":{"We":[0,67],"revisit":[1],"the":[2,12,45,48,52,58,70,80,85,88,101,113,124,129,132,136,147,159,176,180],"classical":[3],"polygonal":[4,152],"line":[5,23,153],"simplification":[6,24,75,111,149],"problem":[7],"and":[8,15,60,73],"study":[9],"it":[10],"using":[11,112,123],"Hausdorff":[13,53,115,126],"distance":[14,56,116,127],"Fr\u00e9chet":[16,55,161],"distance.":[17],"Interestingly,":[18],"no":[19],"previous":[20],"authors":[21],"studied":[22],"under":[25,158],"these":[26],"measures":[27],"in":[28,84,141],"its":[29],"pure":[30],"form,":[31],"namely:":[32],"for":[33,100],"a":[34,40,92,151],"given":[35,91],"\u03b5":[36],">":[37],"0,":[38],"choose":[39],"minimum":[41],"size":[42],"subsequence":[43],"of":[44,47,155,179],"vertices":[46,157],"input":[49,59,130],"such":[50],"that":[51,107,169],"or":[54],"between":[57],"output":[61,133,177],"polylines":[62],"is":[63,117,175],"at":[64],"most":[65],"\u03b5.":[66],"analyze":[68],"how":[69],"well-known":[71],"Douglas-Peucker":[72],"Imai-Iri":[74],"algorithms":[76,89],"perform":[77],"compared":[78],"to":[79,131,145],"optimum":[81,102],"possible,":[82],"also":[83],"situation":[86],"where":[87,173],"are":[90],"considerably":[93],"larger":[94],"error":[95],"threshold":[96],"than":[97],"we":[98,105,163],"require":[99],"solution.":[103],"Furthermore,":[104],"show":[106],"computing":[108],"an":[109,165],"optimal":[110,148],"undirected":[114],"NP-hard.":[118],"The":[119],"same":[120],"holds":[121],"when":[122],"directed":[125],"from":[128,150],"polyline,":[134],"whereas":[135],"reverse":[137],"can":[138],"be":[139],"computed":[140],"polynomial":[142],"time.":[143],"Finally,":[144],"compute":[146],"consisting":[154],"n":[156],"(continuous)":[160],"distance,":[162],"give":[164],"$O(kn^5)$":[166],"time":[167],"algorithm":[168],"requires":[170],"$O(kn^2)$":[171],"space,":[172],"$k$":[174],"complexity":[178],"simplification.":[181]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}