{"id":"https://openalex.org/W1980980862","doi":"https://doi.org/10.1145/1007912.1007953","title":"Time complexity of practical parallel steiner point insertion algorithms","display_name":"Time complexity of practical parallel steiner point insertion algorithms","publication_year":2004,"publication_date":"2004-06-27","ids":{"openalex":"https://openalex.org/W1980980862","doi":"https://doi.org/10.1145/1007912.1007953","mag":"1980980862"},"language":"en","primary_location":{"id":"doi:10.1145/1007912.1007953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in 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/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["Massachusets Instute of Tech"],"affiliations":[{"raw_affiliation_string":"Massachusets Instute of Tech","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034966177","display_name":"Alper \u00dcng\u00f6r","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alper \u00dcng\u00f6r","raw_affiliation_strings":["Duke University"],"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061644327"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7776,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89739447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"267","last_page":"268"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9674000144004822,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.8483232259750366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6522022485733032},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6283419132232666},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5985596776008606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5580419301986694},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5453751087188721},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.46910056471824646},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.4320042133331299},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43145740032196045},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3848223090171814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.287163645029068}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.8483232259750366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6522022485733032},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6283419132232666},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5985596776008606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5580419301986694},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5453751087188721},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.46910056471824646},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.4320042133331299},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43145740032196045},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3848223090171814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.287163645029068},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1007912.1007953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.453.1833","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.453.1833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.edu/~ghodsi/archive/d-papers/SPAA/2004/Time complexity of practical parallel steiner point insertion algorithms.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1550759423","https://openalex.org/W1909076809","https://openalex.org/W2061969459","https://openalex.org/W2103089934","https://openalex.org/W2120018535","https://openalex.org/W2121431945","https://openalex.org/W2122552271","https://openalex.org/W2149694164","https://openalex.org/W2949273805","https://openalex.org/W6633013852"],"related_works":["https://openalex.org/W1883162576","https://openalex.org/W2385297469","https://openalex.org/W2374047534","https://openalex.org/W2001351033","https://openalex.org/W2347819474","https://openalex.org/W2381889232","https://openalex.org/W2359979928","https://openalex.org/W2026181493","https://openalex.org/W2509795980","https://openalex.org/W2385619438"],"abstract_inverted_index":{"An":[0],"effective":[1],"method":[2],"in":[3,21,35],"practice":[4],"to":[5,11],"compute":[6],"quality":[7],"Delaunay":[8],"triangulations":[9],"is":[10,43,51],"apply":[12],"parallel":[13],"refinements":[14],"that":[15,29],"insert":[16],"Steiner":[17],"points":[18],"whose":[19],"prestars":[20],"the":[22,44,52],"triangulation":[23],"do":[24],"not":[25],"overlap.":[26],"We":[27],"show":[28],"these":[30],"algorithms":[31],"can":[32],"be":[33],"implemented":[34],"O(logm)":[36],"time":[37],"using":[38],"m":[39,42],"processors,":[40],"where":[41],"output":[45],"size.":[46],"To":[47],"our":[48],"knowledge,":[49],"this":[50],"first":[53],"such":[54],"analysis.":[55],"Categories":[56],"and":[57,63,67],"Subject":[58],"Descriptors":[59],"F.2.2":[60],"[Nonnumerical":[61],"Algorithms":[62],"Problems]:":[64],"Geo-metrical":[65],"problems":[66],"computations;":[68],"G.2.m":[69],"[Discrete":[70],"Math-":[71]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}