A new insertion sequence for incremental Delaunay triangulation

在线阅读 下载PDF 导出详情
摘要 IncrementalalgorithmisoneofthemostpopularproceduresforconstructingDelaunaytriangulations(DTs).However,thepointinsertionsequencehasagreatimpactontheamountofworkneededfortheconstructionofDTs.Itaffectsthetimeforbothpointlocationandstructureupdate,andhencetheoverallcomputationaltimeofthetriangulationalgorithm.Inthispaper,asimpledeterministicinsertionsequenceisproposedbasedonthebreadth-first-searchonaKd-treewithsomeminormodificationsforbetterper-formance.Usingparentnodesassearch-hints,theproposedinsertionsequenceprovestobefasterandmorestablethantheHilbertcurveorderandbiasedrandomizedinsertionorder(BRIO),especiallyfornon-uniformpointdistributionsoverawiderangeofbenchmarkexamples.
机构地区 不详
出处 《力学学报:英文版》 2013年1期
出版日期 2013年01月11日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献