{"id":"https://openalex.org/W2125805682","doi":"https://doi.org/10.1142/s0218195914600097","title":"GEODESIC-PRESERVING POLYGON SIMPLIFICATION","display_name":"GEODESIC-PRESERVING POLYGON SIMPLIFICATION","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2125805682","doi":"https://doi.org/10.1142/s0218195914600097","mag":"2125805682"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195914600097","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195914600097","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-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/A5091823049","display_name":"Oswin Aichholzer","orcid":"https://orcid.org/0000-0002-2364-0583"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"OSWIN AICHHOLZER","raw_affiliation_strings":["Institute for Software Technology, Graz University of Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Software Technology, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103249365","display_name":"Thomas Hackl","orcid":"https://orcid.org/0000-0002-9875-9415"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"THOMAS HACKL","raw_affiliation_strings":["Institute for Software Technology, Graz University of Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Software Technology, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012765386","display_name":"Matias Korman","orcid":"https://orcid.org/0000-0002-4880-1101"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"MATIAS KORMAN","raw_affiliation_strings":["JST, ERATO, Kawarabayashi Large Graph Project, Japan","National Institute of Informatics (NII), Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"JST, ERATO, Kawarabayashi Large Graph Project, Japan","institution_ids":[]},{"raw_affiliation_string":"National Institute of Informatics (NII), Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050197344","display_name":"Alexander Pilz","orcid":"https://orcid.org/0000-0002-6059-1821"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"ALEXANDER PILZ","raw_affiliation_strings":["Institute for Software Technology, Graz University of Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Software Technology, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073288056","display_name":"Birgit Vogtenhuber","orcid":"https://orcid.org/0000-0002-7166-4467"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"BIRGIT VOGTENHUBER","raw_affiliation_strings":["Institute for Software Technology, Graz University of Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Software Technology, Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5091823049"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":null,"apc_paid":null,"fwci":2.9528,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91180038,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"04","first_page":"307","last_page":"323"},"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.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.7838438749313354},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.6634019613265991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6342203617095947},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6168988943099976},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.6079155206680298},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.58278489112854},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5240609645843506},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.504304051399231},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.48820263147354126},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41498613357543945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3542916774749756},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.33414116501808167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3256545662879944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25585389137268066},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1296248435974121}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7838438749313354},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.6634019613265991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6342203617095947},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6168988943099976},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.6079155206680298},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.58278489112854},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5240609645843506},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.504304051399231},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.48820263147354126},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41498613357543945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3542916774749756},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.33414116501808167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3256545662879944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25585389137268066},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1296248435974121},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195914600097","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195914600097","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W35252975","https://openalex.org/W100746185","https://openalex.org/W1514914425","https://openalex.org/W1557739567","https://openalex.org/W1559830328","https://openalex.org/W1659568777","https://openalex.org/W1801747540","https://openalex.org/W1981934656","https://openalex.org/W1988887029","https://openalex.org/W1990187919","https://openalex.org/W2001513095","https://openalex.org/W2020655744","https://openalex.org/W2034348415","https://openalex.org/W2038699153","https://openalex.org/W2045911857","https://openalex.org/W2052308158","https://openalex.org/W2058510050","https://openalex.org/W2063372577","https://openalex.org/W2074574297","https://openalex.org/W2081751185","https://openalex.org/W2083860217","https://openalex.org/W2088485107","https://openalex.org/W2106413026","https://openalex.org/W2124956076","https://openalex.org/W2125610797","https://openalex.org/W2132339863","https://openalex.org/W2134710090","https://openalex.org/W2139606248","https://openalex.org/W2172137407","https://openalex.org/W3137242876"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2389833224","https://openalex.org/W2466150543","https://openalex.org/W2370449776","https://openalex.org/W2372903818","https://openalex.org/W2381384555","https://openalex.org/W2362048241","https://openalex.org/W320048716","https://openalex.org/W2380220436"],"abstract_inverted_index":{"Polygons":[0],"are":[1,135],"a":[2,67,152],"paramount":[3],"data":[4],"structure":[5],"in":[6,110],"computational":[7],"geometry.":[8],"While":[9],"the":[10,24,27,30,34,43,47,91,100,111,117,165,173],"complexity":[11,32],"of":[12,26,33,46,102,104,113,119,167,175,182],"many":[13],"algorithms":[14,37,157],"on":[15,23,122,164,172],"simple":[16],"polygons":[17,19,123],"or":[18],"with":[20],"holes":[21],"depends":[22],"size":[25,174],"input":[28,61],"polygon,":[29],"intrinsic":[31],"problems":[35,121],"these":[36,183],"solve":[38],"is":[39,108],"often":[40],"related":[41],"to":[42,58],"reflex":[44,88,114,168],"vertices":[45,89,103,169],"polygon.":[48],"In":[49],"this":[50],"paper,":[51],"we":[52],"give":[53],"an":[54,60],"easy-to-describe":[55],"linear-time":[56,186],"method":[57],"replace":[59],"polygon":[62,68],"[Formula:":[63,69,75,79,83,95,105,139,143,176],"see":[64,70,76,80,84,96,106,140,144,177],"text]":[65,71,77,85,107,141],"by":[66],"such":[72],"that":[73,189],"(1)":[74],"contains":[78],"text],":[81,97,145],"(2)":[82],"has":[86],"its":[87],"at":[90],"same":[92],"positions":[93],"as":[94,151],"and":[98,132,142,158],"(3)":[99],"number":[101,112,166],"linear":[109],"vertices.":[115],"Since":[116],"solutions":[118],"numerous":[120],"(including":[124,185],"shortest":[125],"paths,":[126],"geodesic":[127],"hulls,":[128],"separating":[129],"point":[130],"sets,":[131],"Voronoi":[133],"diagrams)":[134],"equivalent":[136],"for":[137,155],"both":[138],"our":[146],"algorithm":[147],"can":[148],"be":[149,191],"used":[150],"preprocessing":[153],"step":[154],"several":[156,181],"makes":[159],"their":[160],"running":[161],"time":[162],"dependent":[163],"rather":[170],"than":[171],"text].":[178],"We":[179],"describe":[180],"applications":[184],"post-processing":[187],"steps":[188],"might":[190],"necessary).":[192]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}