{"id":"https://openalex.org/W2045820439","doi":"https://doi.org/10.1145/1248377.1248435","title":"Sparse parallel Delaunay mesh refinement","display_name":"Sparse parallel Delaunay mesh refinement","publication_year":2007,"publication_date":"2007-06-09","ids":{"openalex":"https://openalex.org/W2045820439","doi":"https://doi.org/10.1145/1248377.1248435","mag":"2045820439"},"language":"en","primary_location":{"id":"doi:10.1145/1248377.1248435","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","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/A5019006543","display_name":"Beno\u00eet Hudson","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Beno\u00eet Hudson","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060118256","display_name":"Todd Phillips","orcid":"https://orcid.org/0000-0001-7382-5191"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Todd Phillips","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019006543"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":6.4382,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95591093,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"347"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9886999726295471,"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.7318432927131653},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7248360514640808},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6729882955551147},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.6465726494789124},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5520859956741333},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5437281727790833},{"id":"https://openalex.org/keywords/mesh-generation","display_name":"Mesh generation","score":0.5047236680984497},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.49045607447624207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4691426157951355},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42833778262138367},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36539942026138306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23177769780158997},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16712242364883423},{"id":"https://openalex.org/keywords/finite-element-method","display_name":"Finite element method","score":0.105826735496521},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.07876592874526978}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7318432927131653},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7248360514640808},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6729882955551147},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.6465726494789124},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5520859956741333},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5437281727790833},{"id":"https://openalex.org/C181145010","wikidata":"https://www.wikidata.org/wiki/Q4418033","display_name":"Mesh generation","level":3,"score":0.5047236680984497},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.49045607447624207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4691426157951355},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42833778262138367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36539942026138306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23177769780158997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16712242364883423},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.105826735496521},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.07876592874526978},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1248377.1248435","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.5744","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~bhudson/papers/hudson07sparse.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.5791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~glmiller/Publications/Papers/HudsonMillerPhillips07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.390.8876","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.8876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Sparse Parallel D elaunay Mesh Refinement.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.5478","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.5478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~tp517/papers/hudson07sparse.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1913337","https://openalex.org/W4092487","https://openalex.org/W67908560","https://openalex.org/W127251908","https://openalex.org/W1480098164","https://openalex.org/W1483979954","https://openalex.org/W1487551524","https://openalex.org/W1498045212","https://openalex.org/W1529084743","https://openalex.org/W1582849972","https://openalex.org/W1965167217","https://openalex.org/W1967337063","https://openalex.org/W1980980862","https://openalex.org/W1987569615","https://openalex.org/W1993541846","https://openalex.org/W1997564653","https://openalex.org/W1999793260","https://openalex.org/W2006749066","https://openalex.org/W2033177550","https://openalex.org/W2033852670","https://openalex.org/W2052793762","https://openalex.org/W2053560582","https://openalex.org/W2056700535","https://openalex.org/W2072535053","https://openalex.org/W2103089934","https://openalex.org/W2108320925","https://openalex.org/W2120018535","https://openalex.org/W2121431945","https://openalex.org/W2125867579","https://openalex.org/W2139724760","https://openalex.org/W2149694164","https://openalex.org/W2169449347","https://openalex.org/W2949273805","https://openalex.org/W4285719527","https://openalex.org/W6605244122","https://openalex.org/W6629185837"],"related_works":["https://openalex.org/W2224363844","https://openalex.org/W330979007","https://openalex.org/W2076501548","https://openalex.org/W1965906701","https://openalex.org/W2156616036","https://openalex.org/W2030792562","https://openalex.org/W1858649450","https://openalex.org/W2103977700","https://openalex.org/W2046348698","https://openalex.org/W2691172191"],"abstract_inverted_index":{"The":[0],"authors":[1],"recently":[2],"introduced":[3],"the":[4,12,39,43,56,77,91,99,107,124],"technique":[5,93,112],"of":[6,18,71,116],"sparse":[7],"mesh":[8,83,118],"refinement":[9,84,119],"to":[10,38,98,134],"produce":[11],"first":[13,92,108],"near-optimal":[14],"sequential":[15,100],"time":[16,47],"bounds":[17,96],"O(n":[19],"lg":[20],"L/s+m)":[21],"for":[22,67,113],"inputs":[23,45],"in":[24,46,59,86,138],"any":[25,68,114],"fixed":[26],"dimension":[27],"with":[28,94,120],"piecewiselinear":[29],"constraining":[30],"(PLC)":[31],"features.":[32],"This":[33,73],"paper":[34],"extends":[35],"that":[36,130],"work":[37,57,95],"parallel":[40,81,111],"case,":[41],"refining":[42],"same":[44],"O(lg(L/s)":[48],"lgm)":[49],"on":[50],"an":[51],"EREW":[52],"PRAM":[53],"while":[54],"maintaining":[55],"bound;":[58],"practice,":[60],"this":[61],"means":[62],"we":[63],"expect":[64],"linear":[65],"speedup":[66],"practical":[69],"number":[70],"processors.":[72],"is":[74,90,106,127,132],"faster":[75],"than":[76],"best":[78],"previously":[79],"known":[80],"Delaunay":[82],"algorithms":[85],"two":[87],"dimensions.":[88],"It":[89],"equal":[97],"case.":[101],"In":[102],"higher":[103],"dimension,":[104],"it":[105,131],"provably":[109],"fast":[110,137],"kind":[115],"quality":[117],"PLC":[121],"inputs.":[122],"Furthermore,":[123],"algorithm's":[125],"implementation":[126],"straightforward":[128],"enough":[129],"likely":[133],"be":[135],"extremely":[136],"practice.":[139]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}