{"id":"https://openalex.org/W2094100801","doi":"https://doi.org/10.1109/rivf.2009.5174607","title":"A Fast Algorithm for Constructing Constrained Delaunay Triangulation","display_name":"A Fast Algorithm for Constructing Constrained Delaunay Triangulation","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2094100801","doi":"https://doi.org/10.1109/rivf.2009.5174607","mag":"2094100801"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2009.5174607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2009.5174607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","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/A5081057944","display_name":"Nguyen Minh Nam","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nguyen Minh Nam","raw_affiliation_strings":["GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","GIS Dept., Vietbando Co., Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","institution_ids":[]},{"raw_affiliation_string":"GIS Dept., Vietbando Co., Ho Chi Minh City, Vietnam","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030724406","display_name":"Nguyen Vinh Nam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen Vinh Nam","raw_affiliation_strings":["GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","GIS Dept., Vietbando Co., Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","institution_ids":[]},{"raw_affiliation_string":"GIS Dept., Vietbando Co., Ho Chi Minh City, Vietnam","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Hoang Van Kiem","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088379","display_name":"Anova Corp (Vietnam)","ror":"https://ror.org/006kn2235","country_code":"VN","type":"company","lineage":["https://openalex.org/I4210088379"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Hoang Van Kiem","raw_affiliation_strings":["GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","[GIS Department Vietbando Company, Ho Chi Minh city, Vietnam]"],"affiliations":[{"raw_affiliation_string":"GIS Department Vietbando Company, Ho Chi Minh city, Vietnam","institution_ids":[]},{"raw_affiliation_string":"[GIS Department Vietbando Company, Ho Chi Minh city, Vietnam]","institution_ids":["https://openalex.org/I4210088379"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081057944"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5588,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8982883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9743219614028931},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.9534860849380493},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.9378659725189209},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.8825839757919312},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.8782109618186951},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.7328981161117554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.642288088798523},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.6267809271812439},{"id":"https://openalex.org/keywords/surface-triangulation","display_name":"Surface triangulation","score":0.6217131614685059},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5779648423194885},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5738633275032043},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5711752772331238},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5398463606834412},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.5346742272377014},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44227302074432373},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3658101558685303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36498862504959106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33638960123062134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0744272768497467},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0669800341129303}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9743219614028931},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.9534860849380493},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.9378659725189209},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.8825839757919312},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.8782109618186951},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.7328981161117554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.642288088798523},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.6267809271812439},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.6217131614685059},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5779648423194885},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5738633275032043},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5711752772331238},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5398463606834412},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5346742272377014},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44227302074432373},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3658101558685303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36498862504959106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33638960123062134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0744272768497467},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0669800341129303},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2009.5174607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2009.5174607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2007039858","https://openalex.org/W2036773635","https://openalex.org/W2160913309"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W149465645","https://openalex.org/W2001351033","https://openalex.org/W4254406543","https://openalex.org/W2354502962","https://openalex.org/W2028864160","https://openalex.org/W1979362696","https://openalex.org/W2611154072","https://openalex.org/W4232052003"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2,94],"a":[3,32,74,85,88,95],"fast":[4,83,107],"incremental":[5,24],"insertion":[6],"algorithm":[7,27,42,93,105],"for":[8,31,97],"constructing":[9],"constrained":[10,98],"Delaunay":[11,25],"triangulation.":[12,66,89],"Constraints":[13],"are":[14],"considered":[15],"any":[16],"kind":[17],"of":[18,23,40,92],"polygonal":[19],"lines.":[20],"The":[21,38,90,104],"bottleneck":[22],"triangulation":[26],"is":[28,46,58,70,106],"the":[29,44],"search":[30],"triangle":[33,75],"containing":[34],"current":[35],"integrating":[36],"point.":[37],"advantage":[39],"our":[41],"over":[43],"others":[45],"that":[47,78],"we":[48,79],"used":[49,59,71],"an":[50,64],"efficient":[51],"Skvortsov's":[52],"algorithm,":[53],"dynamic":[54],"uniform":[55],"grid.":[56],"It":[57],"to":[60,72,110],"insert":[61],"point":[62,86],"into":[63],"existing":[65],"A":[67],"topology":[68],"model":[69],"represent":[73],"network":[76],"so":[77],"can":[80],"easily":[81],"and":[82,108],"locate":[84],"in":[87],"rest":[91],"method":[96],"edges,":[99],"already":[100],"proposed":[101],"by":[102],"Anglada.":[103],"easy":[109],"implement.":[111]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}