{"id":"https://openalex.org/W2886612041","doi":"https://doi.org/10.2312/egp.20181018","title":"Growing Circles: A Region Growing Algorithm for Unstructured Grids and Non-aligned Boundaries","display_name":"Growing Circles: A Region Growing Algorithm for Unstructured Grids and Non-aligned Boundaries","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2886612041","doi":"https://doi.org/10.2312/egp.20181018","mag":"2886612041"},"language":"en","primary_location":{"id":"doi:10.2312/egp.20181018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20181018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egp.20181018","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039935594","display_name":"Saeed Dabbaghchian","orcid":"https://orcid.org/0000-0002-8991-1016"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Dabbaghchian, Saeed","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039935594"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9969000220298767,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996399998664856,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.5744304656982422},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5066719651222229},{"id":"https://openalex.org/keywords/unstructured-grid","display_name":"Unstructured grid","score":0.41412997245788574},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.31796562671661377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17553985118865967},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1297728717327118}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5744304656982422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5066719651222229},{"id":"https://openalex.org/C134620963","wikidata":"https://www.wikidata.org/wiki/Q17078677","display_name":"Unstructured grid","level":3,"score":0.41412997245788574},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.31796562671661377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17553985118865967},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1297728717327118}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2312/egp.20181018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20181018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"mag:2886612041","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/eurographics/eg-posters2018.html#Dabbaghchian18","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Eurographics","raw_type":null}],"best_oa_location":{"id":"doi:10.2312/egp.20181018","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egp.20181018","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2462671660","https://openalex.org/W3153654335","https://openalex.org/W2043208624","https://openalex.org/W2912206231"],"abstract_inverted_index":{"Detecting":[0],"the":[1,17,29,37,55,71,95,98,104,113,126,153,160,163],"boundaries":[2,73,161],"of":[3,23,28,106,112,152,162],"an":[4,43,150],"enclosed":[5],"region":[6,56,100,127],"is":[7,42,52,67,101,123,131,156],"a":[8],"problem":[9],"which":[10,90,130],"arises":[11],"in":[12,89,134],"some":[13],"applications":[14],"such":[15],"as":[16,144,146],"human":[18],"upper":[19,164],"airway":[20,165],"modeling.":[21],"Using":[22],"standard":[24],"algorithms":[25],"fails":[26],"because":[27],"inevitable":[30],"errors,":[31],"i.e.":[32],"gaps":[33],"and":[34,57,97,115],"overlaps":[35],"between":[36],"surrounding":[38,72],"boundaries.":[39],"Growing":[40],"circles":[41,86,114],"automatic":[44],"approach":[45],"to":[46,59,125,158],"address":[47],"this":[48],"problem.":[49],"A":[50],"circle":[51,92],"centered":[53],"inside":[54],"starts":[58],"grow":[60],"by":[61,70,75,103],"increasing":[62],"its":[63,77],"radius.":[64,79],"Its":[65],"growth":[66],"limited":[68],"either":[69],"or":[74],"reaching":[76],"maximum":[78,117],"To":[80],"deal":[81],"with":[82],"complex":[83],"shapes,":[84],"many":[85],"are":[87,119],"used":[88,133],"each":[91],"partially":[93],"reconstructs":[94],"region,":[96],"whole":[99],"determined":[102],"union":[105],"these":[107],"partial":[108],"regions.":[109],"The":[110],"center":[111],"their":[116],"radius":[118],"calculated":[120],"adaptively.":[121],"It":[122],"similar":[124],"growing":[128],"algorithm":[129],"widely":[132],"image":[135],"processing":[136],"applications.":[137],"However,":[138],"it":[139,155],"works":[140],"for":[141],"unstructured":[142],"grids":[143],"well":[145],"Cartesian":[147],"ones.":[148],"As":[149],"application":[151],"method,":[154],"applied":[157],"detect":[159],"cross-sections.":[166]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}