{"id":"https://openalex.org/W2896636821","doi":"https://doi.org/10.1145/3207677.3277948","title":"An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments","display_name":"An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments","publication_year":2018,"publication_date":"2018-10-18","ids":{"openalex":"https://openalex.org/W2896636821","doi":"https://doi.org/10.1145/3207677.3277948","mag":"2896636821"},"language":"en","primary_location":{"id":"doi:10.1145/3207677.3277948","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3207677.3277948","pdf_url":null,"source":{"id":"https://openalex.org/S4306523741","display_name":"Proceedings of the 2nd International Conference on Computer Science and Application Engineering","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Computer Science and Application Engineering","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/A5103036968","display_name":"Nan Li","orcid":"https://orcid.org/0000-0002-8261-1352"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Nan Li","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053609164","display_name":"Bo Jiang","orcid":"https://orcid.org/0000-0002-6238-1596"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Jiang","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100419518","display_name":"Nannan Li","orcid":"https://orcid.org/0000-0001-5563-3735"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Nannan Li","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103036968"],"corresponding_institution_ids":["https://openalex.org/I43313876"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38227147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9983999729156494,"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.9983999729156494,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/disjoint-sets","display_name":"Disjoint sets","score":0.748192548751831},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7179504036903381},{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.6873066425323486},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6032781004905701},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5830967426300049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5786798000335693},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5514640212059021},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.5428978204727173},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.49348461627960205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.476440966129303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4692504405975342},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.4523329734802246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4322819709777832},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1432577669620514},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0803053081035614}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.748192548751831},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7179504036903381},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.6873066425323486},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6032781004905701},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5830967426300049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5786798000335693},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5514640212059021},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.5428978204727173},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.49348461627960205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.476440966129303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4692504405975342},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.4523329734802246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4322819709777832},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1432577669620514},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0803053081035614},{"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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":2,"locations":[{"id":"doi:10.1145/3207677.3277948","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3207677.3277948","pdf_url":null,"source":{"id":"https://openalex.org/S4306523741","display_name":"Proceedings of the 2nd International Conference on Computer Science and Application Engineering","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Computer Science and Application Engineering","raw_type":"proceedings-article"},{"id":"mag:3163153603","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002243605272170","pdf_url":null,"source":{"id":"https://openalex.org/S4306500161","display_name":"ACM Proceedings","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"ACM Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1519368613","https://openalex.org/W1525225516","https://openalex.org/W1920501755","https://openalex.org/W2011039300","https://openalex.org/W2025299767","https://openalex.org/W2046670590","https://openalex.org/W2069683521","https://openalex.org/W2104800753","https://openalex.org/W2105946172","https://openalex.org/W2112513979","https://openalex.org/W2127909774","https://openalex.org/W2143072141","https://openalex.org/W2153374077","https://openalex.org/W2194504615","https://openalex.org/W2767541918","https://openalex.org/W4241977206","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2358001426","https://openalex.org/W1507382935","https://openalex.org/W2439874932","https://openalex.org/W2360117020","https://openalex.org/W2376690466","https://openalex.org/W2741067195","https://openalex.org/W3034791572","https://openalex.org/W2058179942","https://openalex.org/W2389413091","https://openalex.org/W2347453242"],"abstract_inverted_index":{"In":[0],"this":[1,47,124],"paper1,":[2],"we":[3,82,117],"propose":[4],"an":[5,43,119],"efficient":[6],"algorithm":[7,44,121,128],"about":[8],"a":[9,13,51,112],"convex":[10,39,53],"hull":[11],"of":[12,59,111,114,132,157],"disjoint":[14],"segment":[15,31],"collection":[16],"given":[17,60],"in":[18,37,146],"the":[19,23,38,68,79,85,88,104,108,130,138,142,149,155],"plane,":[20],"which":[21,70],"has":[22],"minimum":[24,80,150],"perimeter.":[25],"That":[26],"is":[27,32,135],"to":[28,45,67,122,137],"say":[29],"each":[30],"completely":[33],"or":[34],"partly":[35],"contained":[36],"hull.":[40],"We":[41],"present":[42],"solve":[46,123],"problem":[48],"by":[49,63,73,92,106],"contracting":[50],"larger":[52],"polygon":[54],"containing":[55],"all":[56],"end":[57],"points":[58,95],"segments,":[61],"constructed":[62],"Graham":[64],"Scanning":[65],"Algorithm,":[66],"smallest":[69],"only":[71],"comprised":[72],"some":[74,97],"indispensable":[75],"points.":[76],"To":[77],"achieve":[78],"perimeter,":[81],"also":[83],"assess":[84],"relationships":[86],"between":[87],"triangle":[89,105],"that":[90,102],"formed":[91],"three":[93],"adjacent":[94],"and":[96,99,134,154],"segments":[98,101],"add":[100],"inside":[103],"determining":[107],"shortest":[109],"route":[110,145,153],"series":[113],"segments.":[115],"Then":[116],"give":[118],"O(n4)":[120,133],"problem.":[125],"Our":[126],"novel":[127],"holds":[129],"complexity":[131],"applicable":[136],"robot":[139],"walking":[140],"route,":[141],"optimal":[143],"distribution":[144],"logistics":[147],"planning,":[148],"cost":[151],"travel":[152],"cutting":[156],"machine":[158],"parts.":[159]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}