{"id":"https://openalex.org/W6963815072","doi":"https://doi.org/10.2312/egpgv/egpgv02/097-104","title":"An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes","display_name":"An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W6963815072","doi":"https://doi.org/10.2312/egpgv/egpgv02/097-104"},"language":"en","primary_location":{"id":"doi:10.2312/egpgv/egpgv02/097-104","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv02/097-104","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egpgv/egpgv02/097-104","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ueng, Shyh-Kuang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ueng, Shyh-Kuang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sikorski, K.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sikorski, K.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.8327999711036682},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.6439999938011169},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5016999840736389},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.43389999866485596},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.42329999804496765},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4129999876022339},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3540000021457672},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.3154999911785126}],"concepts":[{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.8327999711036682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7497000098228455},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.6439999938011169},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5016999840736389},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.43389999866485596},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.42329999804496765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3878999948501587},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37599998712539673},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26600000262260437},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/egpgv/egpgv02/097-104","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv02/097-104","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":"article"}],"best_oa_location":{"id":"doi:10.2312/egpgv/egpgv02/097-104","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv02/097-104","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Adjacency":[0,132],"graphs":[1,16],"of":[2,48,57],"meshes":[3],"are":[4,66,80,89,109,121,135,154,166],"important":[5],"for":[6,45],"visualizing":[7],"or":[8],"compressing":[9],"unstructured":[10,50],"scientific":[11],"data.":[12],"However,":[13],"calculating":[14],"adjacency":[15],"requires":[17],"intensive":[18],"memory":[19,70,100,125],"space.":[20],"For":[21,73],"large":[22,49],"data":[23,52],"sets,":[24],"the":[25,61,115,118,161,178],"calculation":[26],"becomes":[27],"very":[28],"inefficient":[29],"on":[30],"desk-top":[31],"computers":[32],"with":[33],"limited":[34],"main":[35,69,99,124],"memory.":[36],"In":[37],"this":[38],"article,":[39],"an":[40],"out-of-core":[41],"method":[42],"is":[43,181],"presented":[44],"finding":[46],"connectivities":[47],"FEA":[51,64],"sets.":[53],"Our":[54],"algorithm":[55],"composes":[56],"three":[58],"stages.":[59],"At":[60,114,160],"first":[62],"stage,":[63,117,163],"cells":[65],"read":[67],"into":[68,84,123,168],"in":[71,98,111,137,151,156],"blocks.":[72],"each":[74,94,138],"cell":[75,78],"block":[76],"read,":[77],"faces":[79,143],"generated":[81],"and":[82,126,144,177],"distributed":[83],"disjoint":[85],"groups.":[86],"These":[87],"groups":[88,108,120],"small":[90],"enough":[91],"such":[92],"that":[93],"group":[95,140,153],"can":[96],"reside":[97],"without":[101],"causing":[102],"any":[103],"page":[104],"swapping.":[105],"The":[106,148],"resulted":[107],"stored":[110],"disk":[112,158],"files.":[113],"second":[116],"face":[119,139],"fetched":[122],"processed":[127],"there":[128],"one":[129],"after":[130],"another.":[131],"graph":[133],"edges":[134,149],"determined":[136],"by":[141,172],"sorting":[142],"examining":[145],"consecutive":[146],"faces.":[147],"contained":[150],"a":[152,157,169],"kept":[155],"file.":[159],"third":[162],"edge":[164],"files":[165],"merged":[167],"single":[170],"file":[171],"using":[173],"external":[174],"merge":[175],"sort,":[176],"connectivity":[179],"information":[180],"computed.":[182]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}