{"id":"https://openalex.org/W6963674113","doi":"https://doi.org/10.2312/egpgv/egpgv08/033-040","title":"Parallel Simplification of Large Meshes on PC Clusters","display_name":"Parallel Simplification of Large Meshes on PC Clusters","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W6963674113","doi":"https://doi.org/10.2312/egpgv/egpgv08/033-040"},"language":"en","primary_location":{"id":"doi:10.2312/egpgv/egpgv08/033-040","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/033-040","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/egpgv08/033-040","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Xiong, Hua","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiong, Hua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Jiang, Xiaohong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Xiaohong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Zhang, Yaping","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yaping","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Shi, Jiaoying","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi, Jiaoying","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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/polygon-mesh","display_name":"Polygon mesh","score":0.892300009727478},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5080000162124634},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5013999938964844},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4860000014305115},{"id":"https://openalex.org/keywords/t-vertices","display_name":"T-vertices","score":0.4713999927043915},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4307999908924103},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.4230000078678131},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.364300012588501}],"concepts":[{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.892300009727478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7225000262260437},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6353999972343445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5230000019073486},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5080000162124634},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4860000014305115},{"id":"https://openalex.org/C160403270","wikidata":"https://www.wikidata.org/wiki/Q7667943","display_name":"T-vertices","level":4,"score":0.4713999927043915},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4307999908924103},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.4230000078678131},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.37070000171661377},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3301999866962433},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C181145010","wikidata":"https://www.wikidata.org/wiki/Q4418033","display_name":"Mesh generation","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C198880260","wikidata":"https://www.wikidata.org/wiki/Q5289813","display_name":"Domain decomposition methods","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/egpgv/egpgv08/033-040","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/033-040","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/egpgv08/033-040","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/033-040","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"meshes":[1,59,143],"are":[2,18,133],"becoming":[3],"commonplace":[4],"with":[5],"the":[6,27,88,112,126,138],"advance":[7],"of":[8,29,141,147,154],"3D":[9],"scanning,":[10],"scientific":[11],"simulation":[12],"and":[13,85,110,125],"CAD":[14],"technology.":[15],"While":[16],"there":[17],"many":[19],"algorithms":[20,39],"proposed":[21],"to":[22,54,102,135,149],"simplify":[23],"these":[24,77,120],"large":[25,58,71,142],"meshes,":[26],"time":[28],"simplification":[30,67,101,123,140],"process":[31],"is":[32],"usually":[33],"very":[34],"long,":[35],"especially":[36],"for":[37],"those":[38],"based":[40],"on":[41,60,151],"iterative":[42,139],"edge":[43],"collapse.":[44],"To":[45],"address":[46],"this":[47],"problem,":[48],"we":[49],"propose":[50],"two":[51,121],"parallel":[52,66,80,105,122],"schemes":[53,124],"speed":[55,136],"up":[56,137],"simplifying":[57],"a":[61,70,145,152],"PC":[62],"cluster.":[63],"The":[64,92],"first":[65],"scheme":[68,94],"partitions":[69],"mesh":[72,97,115],"into":[73],"small":[74],"sub-meshes,":[75],"simplifies":[76],"sub-meshes":[78],"in":[79,81,104,106],"an":[82,107],"in-core":[83],"way":[84],"finally":[86],"stitches":[87],"simplified":[89,114],"versions":[90],"together.":[91],"second":[93],"generates":[95],"multiple":[96],"streams,":[98],"applies":[99],"stream":[100],"them":[103],"out-of-core":[108],"way,":[109],"composes":[111],"final":[113],"streams.":[116],"We":[117],"have":[118],"implemented":[119],"experimental":[127],"results":[128],"show":[129],"that":[130],"our":[131],"methods":[132],"able":[134],"by":[144],"factor":[146],"8":[148],"19":[150],"cluster":[153],"24":[155],"PCs.":[156]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}