{"id":"https://openalex.org/W2097659189","doi":"https://doi.org/10.1109/mdm.2011.53","title":"Efficient Online Algorithms for the Polygonal Approximation of Trajectory Data","display_name":"Efficient Online Algorithms for the Polygonal Approximation of Trajectory Data","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2097659189","doi":"https://doi.org/10.1109/mdm.2011.53","mag":"2097659189"},"language":"en","primary_location":{"id":"doi:10.1109/mdm.2011.53","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mdm.2011.53","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 12th International Conference on Mobile Data Management","raw_type":"proceedings-article"},"type":"article","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/A5000026575","display_name":"Alexander Kolesnikov","orcid":null},"institutions":[{"id":"https://openalex.org/I175532246","display_name":"University of Eastern Finland","ror":"https://ror.org/00cyydd11","country_code":"FI","type":"education","lineage":["https://openalex.org/I175532246"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Alexander Kolesnikov","raw_affiliation_strings":["School of Computing, University of Eastern Finland, Joensuu, Finland","Sch. of Comput., Univ. of Eastern Finland, Joensuu, Finland#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Eastern Finland, Joensuu, Finland","institution_ids":["https://openalex.org/I175532246"]},{"raw_affiliation_string":"Sch. of Comput., Univ. of Eastern Finland, Joensuu, Finland#TAB#","institution_ids":["https://openalex.org/I175532246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000026575"],"corresponding_institution_ids":["https://openalex.org/I175532246"],"apc_list":null,"apc_paid":null,"fwci":0.6125,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.67123561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2992","issue":null,"first_page":"49","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9930999875068665,"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"}},{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/trajectory","display_name":"Trajectory","score":0.7040927410125732},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.6719328165054321},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6623320579528809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6356209516525269},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5934509634971619},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5276735424995422},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5179744958877563},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.48951685428619385},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4611305296421051},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4453947842121124},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4437277615070343},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4250409007072449},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42211073637008667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.291107177734375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18346545100212097}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7040927410125732},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.6719328165054321},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6623320579528809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6356209516525269},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5934509634971619},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5276735424995422},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5179744958877563},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.48951685428619385},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4611305296421051},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4453947842121124},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4437277615070343},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4250409007072449},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42211073637008667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.291107177734375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18346545100212097},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mdm.2011.53","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mdm.2011.53","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 12th International Conference on Mobile Data Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1489091441","https://openalex.org/W1527435746","https://openalex.org/W1561671573","https://openalex.org/W1587714835","https://openalex.org/W1600482701","https://openalex.org/W1840640513","https://openalex.org/W1967295774","https://openalex.org/W1973355601","https://openalex.org/W1981934656","https://openalex.org/W1996964686","https://openalex.org/W2004079892","https://openalex.org/W2008987433","https://openalex.org/W2025306868","https://openalex.org/W2038465052","https://openalex.org/W2041409606","https://openalex.org/W2047519109","https://openalex.org/W2075213142","https://openalex.org/W2079280466","https://openalex.org/W2107633943","https://openalex.org/W2112824976","https://openalex.org/W2123630097","https://openalex.org/W2123695992","https://openalex.org/W2140251882","https://openalex.org/W2148173348","https://openalex.org/W2153249319","https://openalex.org/W2155239911","https://openalex.org/W2737320289","https://openalex.org/W6629196680","https://openalex.org/W6635262917","https://openalex.org/W6635913942","https://openalex.org/W6741337733"],"related_works":["https://openalex.org/W2044115164","https://openalex.org/W2110817230","https://openalex.org/W4308943899","https://openalex.org/W2014137052","https://openalex.org/W4308701628","https://openalex.org/W1606488336","https://openalex.org/W2165420145","https://openalex.org/W2171221472","https://openalex.org/W189995875","https://openalex.org/W3091355678"],"abstract_inverted_index":{"The":[0,76],"paper":[1],"deals":[2],"with":[3,14,28],"the":[4,22,41,53,56,66,72],"problem":[5],"of":[6,21,43,55,68,74],"how":[7],"most":[8],"efficiently":[9],"to":[10,71,83],"represent":[11],"trajectory":[12],"data":[13,86],"a":[15,49],"piecewise":[16],"--":[17],"constant":[18],"velocity":[19],"model":[20],"object":[23],"movement.":[24],"Firstly,":[25],"we":[26,60],"experimented":[27],"fast":[29],"and":[30,37,45,87],"efficient":[31,62],"offline":[32],"algorithms":[33,39],"based":[34],"on":[35,52],"heuristic":[36],"optimal":[38],"for":[40,48,65],"approximation":[42,57,67],"planar":[44],"spatial":[46],"curves":[47],"given":[50],"constraint":[51],"maximum":[54],"error.":[58],"Secondly,":[59],"developed":[61],"online":[63,77],"algorithm":[64,78],"trajectories":[69],"adaptive":[70],"size":[73],"buffer.":[75],"can":[79],"be":[80],"successfully":[81],"used":[82],"reduce":[84],"spatiotemporal":[85],"multidimensional":[88],"signals.":[89]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}