{"id":"https://openalex.org/W2029619478","doi":"https://doi.org/10.1007/s00454-008-9132-4","title":"Streaming Algorithms for Line Simplification","display_name":"Streaming Algorithms for Line Simplification","publication_year":2009,"publication_date":"2009-01-12","ids":{"openalex":"https://openalex.org/W2029619478","doi":"https://doi.org/10.1007/s00454-008-9132-4","mag":"2029619478"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-008-9132-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9132-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9132-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9132-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017968782","display_name":"Mohammad Ali Abam","orcid":"https://orcid.org/0000-0002-8345-8783"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"M. A. Abam","raw_affiliation_strings":["MADALGO, Department of Computing Science, Aarhus University, Aarhus, Denmark","Aarhus University, MADALGO, Department of Computing Science, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computing Science, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128","https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, MADALGO, Department of Computing Science, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M. de Berg","raw_affiliation_strings":["Department of Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","TU Eindhoven, Department of Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, Department of Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030440460","display_name":"Peter Hachenberger","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]},{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"P. Hachenberger","raw_affiliation_strings":["MADALGO, Department of Computing Science, Aarhus University, Aarhus, Denmark","Aarhus University, MADALGO, Department of Computing Science, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computing Science, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128","https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, MADALGO, Department of Computing Science, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042820322","display_name":"Alireza Zarei","orcid":"https://orcid.org/0000-0002-8823-6805"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. Zarei","raw_affiliation_strings":["Computer Engineering Department, Sharif University of Technology and IPM School of Computer Science, P.O. Box 11365-9517, Tehran, Iran","Sharif University of Technology and IPM School of Computer Science, Computer Engineering Department, P.O. Box 11365-9517, Tehran, Iran#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Sharif University of Technology and IPM School of Computer Science, P.O. Box 11365-9517, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]},{"raw_affiliation_string":"Sharif University of Technology and IPM School of Computer Science, Computer Engineering Department, P.O. Box 11365-9517, Tehran, Iran#TAB#","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017968782"],"corresponding_institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":4.4669,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94131787,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"43","issue":"3","first_page":"497","last_page":"515"},"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.9965999722480774,"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.9965999722480774,"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.988099992275238,"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"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.7763378620147705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6805405616760254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6593132615089417},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6024426221847534},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6004496812820435},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5767472982406616},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.576711893081665},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.554825484752655},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5119510889053345},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4970112144947052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44878506660461426},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4174370765686035},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28822484612464905},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.16819307208061218},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12586870789527893}],"concepts":[{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.7763378620147705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6805405616760254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6593132615089417},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6024426221847534},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6004496812820435},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5767472982406616},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.576711893081665},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.554825484752655},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5119510889053345},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4970112144947052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44878506660461426},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4174370765686035},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28822484612464905},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.16819307208061218},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12586870789527893},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1007/s00454-008-9132-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9132-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9132-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2914e769-f820-4330-a5e2-206d7d09b887","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2914e769-f820-4330-a5e2-206d7d09b887","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abam, M A, Berg, de, M, Hachenberger, P & Zarei, A 2010, 'Streaming algorithms for line simplification', Discrete and Computational Geometry, vol. 43, no. 3, pp. 497-515. https://doi.org/10.1007/s00454-008-9132-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:650933","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=650933","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0179-5376","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.7132","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.7132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mehr.sharif.ir/~zarei/papers/line-simp-socg07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.6867","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.6867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~phachenb/Publications/streamingAlgLineSimplification.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.562.1671","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.562.1671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/ACM SoCG/2007/Streaming Algorithms for Line Simplification.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:650933","is_oa":false,"landing_page_url":"http://repository.tue.nl/650933","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0179-5376","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:659790","is_oa":false,"landing_page_url":"http://repository.tue.nl/659790","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:publications/23c5dfd0-bf21-11de-82fe-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/23c5dfd0-bf21-11de-82fe-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abam, M, de Berg, M, Hachenberger, P & Zarei, A 2010, 'Streaming Algorithms for Line Simplification', Discrete & Computational Geometry, vol. 43, no. 3, pp. 497-515. https://doi.org/10.1007/s00454-008-9132-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/26c46a2a-5f63-42e7-9876-b08df8c01859","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/26c46a2a-5f63-42e7-9876-b08df8c01859","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 23rd Annual ACM Symposium on Computational Geometry (SoCG 2007) 6-8 June 2007, Geongju, South Korea, 175 - 183","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2914e769-f820-4330-a5e2-206d7d09b887","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2914e769-f820-4330-a5e2-206d7d09b887","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete and Computational Geometry, 43(3), 497 - 515. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00454-008-9132-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9132-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9132-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3034753964","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320943","display_name":"Danmarks Grundforskningsfond","ror":"https://ror.org/00znyv691"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320324281","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2029619478.pdf","grobid_xml":"https://content.openalex.org/works/W2029619478.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W13547501","https://openalex.org/W53622112","https://openalex.org/W101345945","https://openalex.org/W278703347","https://openalex.org/W1491827522","https://openalex.org/W1561671573","https://openalex.org/W1580855309","https://openalex.org/W1583874435","https://openalex.org/W1897841194","https://openalex.org/W1965972569","https://openalex.org/W1981934656","https://openalex.org/W1983699268","https://openalex.org/W1995484833","https://openalex.org/W2030443509","https://openalex.org/W2038647971","https://openalex.org/W2042205666","https://openalex.org/W2091376083","https://openalex.org/W2096606628","https://openalex.org/W2114303587","https://openalex.org/W2124299914","https://openalex.org/W2162911459","https://openalex.org/W2172137407"],"related_works":["https://openalex.org/W3045508281","https://openalex.org/W4255309945","https://openalex.org/W2099234771","https://openalex.org/W2032330073","https://openalex.org/W2942906518","https://openalex.org/W2150988180","https://openalex.org/W2388499291","https://openalex.org/W2048256194","https://openalex.org/W3204290128","https://openalex.org/W2034331916"],"abstract_inverted_index":{"We":[0,48,73,112],"study":[1,49],"the":[2,6,24,34,43,71,75,97,103,106,114,126,131,140,145,155,160,164,167,175,179],"following":[3],"variant":[4],"of":[5,17,42,63,78,99,105],"well-known":[7],"line-simplification":[8],"problem:":[9],"we":[10,32,36,57,67,84],"are":[11],"getting":[12],"a":[13,27,40,53,60,89],"(possibly":[14],"infinite)":[15],"sequence":[16],"points":[18,94],"p":[19],"0,p":[20],"1,p":[21],"2,\u2026":[22],"in":[23,52,174],"plane":[25],"defining":[26],"polygonal":[28],"path,":[29],"and":[30,95,151,173],"as":[31],"receive":[33],"points,":[35],"wish":[37],"to":[38,102],"maintain":[39,88],"simplification":[41,90,101,108],"path":[44],"seen":[45],"so":[46,65],"far.":[47],"this":[50],"problem":[51],"streaming":[54],"setting,":[55],"where":[56,125,139,154],"only":[58],"have":[59],"limited":[61],"amount":[62],"storage,":[64,172],"that":[66],"cannot":[68],"store":[69],"all":[70],"points.":[72,111],"analyze":[74],"competitive":[76,118],"ratio":[77,119],"our":[79,86,100],"algorithms,":[80],"allowing":[81],"resource":[82],"augmentation:":[83],"let":[85],"algorithm":[87,168,180],"with":[91,109,116],"2k":[92],"(internal)":[93],"compare":[96],"error":[98,104,127,141,156],"optimal":[107],"k":[110],"obtain":[113],"algorithms":[115],"O(1)":[117],"for":[120],"three":[121],"cases:":[122],"convex":[123],"paths,":[124,138,153],"is":[128,142,157],"measured":[129,143,158],"using":[130,144,159],"Hausdorff":[132,146],"distance":[133,147],"(or":[134,148],"Fr\u00e9chet":[135,149,161],"distance),":[136,150],"xy-monotone":[137],"general":[152],"distance.":[162],"In":[163],"first":[165],"case":[166],"needs":[169,181],"O(k)":[170],"additional":[171,184],"latter":[176],"two":[177],"cases":[178],"O(k":[182],"2)":[183],"storage.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}