{"id":"https://openalex.org/W7097655871","doi":null,"title":"Chapter 10 A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation*","display_name":"Chapter 10 A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation*","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097655871"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.637.4764","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.637.4764","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/unm_math_579/course_papers/p83-ruppert.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polygon-triangulation","display_name":"polygon triangulation","score":0.8960000276565552},{"id":"https://openalex.org/keywords/planar-straight-line-graphs","display_name":"planar straight-line graphs","score":0.9539999961853027},{"id":"https://openalex.org/keywords/finite-element-mesh","display_name":"finite element mesh","score":0.7549999952316284},{"id":"https://openalex.org/keywords/quadtree","display_name":"quadtree","score":0.5339999794960022}],"concepts":[{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.83160001039505},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.7688999772071838},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.7164000272750854},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6172000169754028},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.6013000011444092},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5985999703407288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5900999903678894},{"id":"https://openalex.org/C181145010","wikidata":"https://www.wikidata.org/wiki/Q4418033","display_name":"Mesh generation","level":3,"score":0.5440000295639038},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.48989999294281006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48019999265670776},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4388999938964844},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C170589453","wikidata":"https://www.wikidata.org/wiki/Q7940896","display_name":"Volume mesh","level":4,"score":0.37279999256134033},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C194401833","wikidata":"https://www.wikidata.org/wiki/Q3456889","display_name":"Triangle mesh","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.637.4764","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.637.4764","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/unm_math_579/course_papers/p83-ruppert.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2122552271","https://openalex.org/W1967337063","https://openalex.org/W1549422067","https://openalex.org/W107408007","https://openalex.org/W2075019391","https://openalex.org/W2120018535","https://openalex.org/W7097188768","https://openalex.org/W7098927687","https://openalex.org/W2129412583","https://openalex.org/W1603881382"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,24,35,87,123],"simple":[3],"new":[4],"algorithm":[5,116],"for":[6,48],"triangulating":[7],"poly-gons":[8],"and":[9,17,65,69,104,131,136],"planar":[10],"straightline":[11],"graphs.":[12],"It":[13,127],"provides":[14],"\u201cshape":[15],"\u201d":[16,42],"%izen":[18],"guarantees:":[19],"l":[20,28],"All":[21],"triangles":[22,32,95],"have":[23,107],"bounded":[25],"aspect":[26],"ratio.":[27],"The":[29,78,113],"number":[30,62],"of":[31,38,63,83,91],"is":[33,128],"within":[34],"constant":[36],"factor":[37],"optimal.":[39],"Such":[40],"\u201cquality":[41],"triangulations":[43],"are":[44],"desirable":[45],"as":[46],"meshes":[47,141],"the":[49,55,61,67,84],"finite":[50],"element":[51],"method,":[52],"in":[53,98,142],"which":[54],"running":[56],"time":[57],"generally":[58,138],"increases":[59],"with":[60,102],"triangles,":[64],"where":[66],"con-vergence":[68],"stability":[70],"may":[71],"be":[72],"hurt":[73],"by":[74,93],"very":[75],"shinny":[76],"triangles.":[77],"technique":[79,90],"we":[80],"use-successive":[81],"refinement":[82,115],"Delau-nay":[85],"triangulation-extends":[86],"mesh":[88],"generation":[89],"Chew":[92],"allowing":[94],"that":[96],"vary":[97],"size.":[99],"Previous":[100],"al-gorithms":[101],"shape":[103],"size":[105],"bounds":[106],"all":[108],"been":[109],"based":[110],"on":[111],"quadtrees.":[112],"Delaunay":[114],"matches":[117],"their":[118],"theoretical":[119],"bounds,":[120],"but":[121],"uses":[122],"fundamentally":[124],"different":[125],"approach.":[126],"much":[129],"simpler,":[130],"hence":[132],"easier":[133],"to":[134],"implement,":[135],"it":[137],"produces":[139],"smaller":[140],"practice.":[143],"1":[144]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}