{"id":"https://openalex.org/W2374047534","doi":null,"title":"A Local Adjustment Algorithm for Inserting Constrained Segments in Delaunay Triangulation","display_name":"A Local Adjustment Algorithm for Inserting Constrained Segments in Delaunay Triangulation","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2374047534","mag":"2374047534"},"language":"en","primary_location":{"id":"mag:2374047534","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-XNJT200204009.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306535130","display_name":"Journal of Southwest Jiaotong University","issn_l":"0258-2724","issn":["0258-2724","1005-2429"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Southwest Jiaotong University","raw_type":null},"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":[{"author_position":"first","author":{"id":"https://openalex.org/A5044054507","display_name":"Song Zhan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Song Zhan","raw_affiliation_strings":["feng,  ZHAN Zhen  yan,  PU Hao"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"feng,  ZHAN Zhen  yan,  PU Hao","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044054507"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.37332311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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/constrained-delaunay-triangulation","display_name":"constrained Delaunay triangulation","score":1.0},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.6980000138282776}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.985862135887146},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.9519087076187134},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.9334601163864136},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.8869170546531677},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.7499051094055176},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.6667513251304626},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6097642779350281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5562905669212341},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5439578890800476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.531509280204773},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.5254998207092285},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.5095908641815186},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4331762492656708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3938373327255249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.352934330701828},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14396843314170837},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2374047534","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-XNJT200204009.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306535130","display_name":"Journal of Southwest Jiaotong University","issn_l":"0258-2724","issn":["0258-2724","1005-2429"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Southwest Jiaotong University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2384899249","https://openalex.org/W2154441579","https://openalex.org/W2374107638","https://openalex.org/W2381889232","https://openalex.org/W2094100801","https://openalex.org/W2361081679","https://openalex.org/W2390635165","https://openalex.org/W1996934342","https://openalex.org/W2383147437","https://openalex.org/W2343655394"],"abstract_inverted_index":{"An":[0],"algorithm":[1,86,95],"for":[2,14,72],"constructing":[3],"constrained":[4,15,23,60],"Delaunay":[5,12,27],"triangulation":[6,13],"(CDT)":[7],"is":[8,18,32,64,78,88,91],"presented.":[9,79],"First,":[10],"the":[11,26,39,44,47,55,59,69,73,81,85,94],"data":[16],"sets":[17],"constructed.":[19],"Then,":[20],"by":[21],"inserting":[22,58],"segments":[24,61],"into":[25,62],"triangulation,":[28],"a":[29,97,101],"local":[30],"adjustment":[31],"made":[33],"to":[34],"its":[35],"impact":[36],"area":[37],"on":[38,43],"maximum":[40],"angle":[41],"principle":[42],"condition":[45],"that":[46,93],"basic":[48],"properties":[49],"of":[50,57,84],"CDT":[51,63,77],"are":[52],"satisfied.":[53],"Meanwhile,":[54],"process":[56],"expounded":[65],"in":[66,76],"detail,":[67],"and":[68,100],"updating":[70],"method":[71],"topological":[74],"relations":[75],"Finally,":[80],"time":[82],"efficiency":[83,99],"proposed":[87],"analyzed.":[89],"It":[90],"shown":[92],"has":[96],"high":[98],"stable":[102],"operation.":[103]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T06:02:39.697066","created_date":"2016-06-24T00:00:00"}