{"id":"https://openalex.org/W2139943869","doi":"https://doi.org/10.1142/s021819599700003x","title":"Finding a Covering Triangulation Whose Maximum Angle is Provably Small","display_name":"Finding a Covering Triangulation Whose Maximum Angle is Provably Small","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2139943869","doi":"https://doi.org/10.1142/s021819599700003x","mag":"2139943869"},"language":"en","primary_location":{"id":"doi:10.1142/s021819599700003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819599700003x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-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/A5050840284","display_name":"Scott A. Mitchell","orcid":"https://orcid.org/0000-0003-3710-4500"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Scott A. Mitchell","raw_affiliation_strings":["Computational Mechanics & Visualization Department, Sandia National Laboratories, MS 0441, P. O. Box 5800,  Albuquerque, New Mexico 87185-5800, U.S.A","Computational Mechanics & Visualization Department, Sandia National Laboratories, MS 0441, P. O. Box 5800, Albuquerque, New Mexico 87185-5800, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computational Mechanics & Visualization Department, Sandia National Laboratories, MS 0441, P. O. Box 5800,  Albuquerque, New Mexico 87185-5800, U.S.A","institution_ids":["https://openalex.org/I192454743","https://openalex.org/I4210104735"]},{"raw_affiliation_string":"Computational Mechanics & Visualization Department, Sandia National Laboratories, MS 0441, P. O. Box 5800, Albuquerque, New Mexico 87185-5800, U.S.A","institution_ids":["https://openalex.org/I192454743","https://openalex.org/I4210104735"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050840284"],"corresponding_institution_ids":["https://openalex.org/I192454743","https://openalex.org/I4210104735"],"apc_list":null,"apc_paid":null,"fwci":0.7293,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.73017621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"07","issue":"01n02","first_page":"5","last_page":"20"},"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.9984999895095825,"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.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9726999998092651,"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/triangulation","display_name":"Triangulation","score":0.7847065925598145},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.7773988842964172},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7742109894752502},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.741722822189331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7359857559204102},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.6543188095092773},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.5918978452682495},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5466991662979126},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4941578209400177},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.46890226006507874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4497603178024292},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.4401700794696808},{"id":"https://openalex.org/keywords/surface-triangulation","display_name":"Surface triangulation","score":0.42869627475738525},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.4283013641834259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3379409909248352},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.23075789213180542},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06338077783584595}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.7847065925598145},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.7773988842964172},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7742109894752502},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.741722822189331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7359857559204102},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.6543188095092773},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5918978452682495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5466991662979126},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4941578209400177},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.46890226006507874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4497603178024292},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.4401700794696808},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.42869627475738525},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.4283013641834259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3379409909248352},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.23075789213180542},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06338077783584595}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s021819599700003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819599700003x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.9341","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sandia.gov/~samitch/csstuff/GG/COVER/minmax-cover.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":0,"referenced_works":[],"related_works":["https://openalex.org/W1483219455","https://openalex.org/W149465645","https://openalex.org/W2381084059","https://openalex.org/W2350914983","https://openalex.org/W2001351033","https://openalex.org/W109258179","https://openalex.org/W2028864160","https://openalex.org/W113718658","https://openalex.org/W2172589357","https://openalex.org/W3148956508"],"abstract_inverted_index":{"We":[0,89,193],"consider":[1],"the":[2,32,41,51,98,160,186,191],"following":[3],"problem:":[4],"given":[5],"a":[6,11,26,62,71,79,106,119,165],"planar":[7],"straight-line":[8],"graph,":[9],"find":[10],"covering":[12,23,46,103,120,166],"triangulation":[13,24,27,47,54,104,121],"whose":[14,28,37,122],"maximum":[15,99,123,168],"angle":[16,100,124],"is":[17,25,126,143,150,185],"as":[18,20,82],"small":[19],"possible.":[21],"A":[22],"vertex":[29,34,63],"set":[30,35,39],"contains":[31,40],"input":[33,42,66,108],"and":[36,176],"edge":[38,43],"set.":[44],"The":[45],"problem":[48,55],"differs":[49],"from":[50],"usual":[52],"Steiner":[53,174],"in":[56,101,110,178],"that":[57,136],"we":[58,134],"may":[59],"not":[60,144],"add":[61],"on":[64,97,164],"any":[65,102],"edge.":[67],"Covering":[68],"triangulations":[69],"provide":[70],"convenient":[72],"method":[73],"for":[74],"triangulating":[75],"multiple":[76],"regions":[77],"sharing":[78],"common":[80],"boundary,":[81],"each":[83],"region":[84],"can":[85],"be":[86],"triangulated":[87],"independently.":[88],"give":[90],"an":[91,196],"explicit":[92],"lower":[93],"bound":[94,163],"\u03b3":[95,125,130,142,151],"opt":[96,131,152],"of":[105,112,188,190,202],"particular":[107],"graph":[109],"terms":[111],"its":[113],"local":[114],"geometry.":[115],"Our":[116,170],"algorithm":[117,171],"produces":[118],"provably":[127],"close":[128],"to":[129,147],".":[132,153],"Specifically,":[133],"show":[135],"[Formula:":[137],"see":[138],"text],":[139],"i.e.,":[140],"our":[141,155,203],"much":[145],"closer":[146],"\u03c0":[148],"than":[149],"To":[154],"knowledge,":[156],"this":[157],"result":[158],"represents":[159],"first":[161],"nontrivial":[162],"triangulation's":[167],"angle.":[169],"adds":[172],"O(n)":[173],"points":[175],"runs":[177],"time":[179,200],"O(n":[180,197],"log":[181],"n),":[182],"where":[183],"n":[184],"number":[187],"vertices":[189],"input.":[192],"have":[194],"implemented":[195],"2":[198],")":[199],"version":[201],"algorithm.":[204]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}