摘要
IncrementalalgorithmisoneofthemostpopularproceduresforconstructingDelaunaytriangulations(DTs).However,thepointinsertionsequencehasagreatimpactontheamountofworkneededfortheconstructionofDTs.Itaffectsthetimeforbothpointlocationandstructureupdate,andhencetheoverallcomputationaltimeofthetriangulationalgorithm.Inthispaper,asimpledeterministicinsertionsequenceisproposedbasedonthebreadth-first-searchonaKd-treewithsomeminormodificationsforbetterper-formance.Usingparentnodesassearch-hints,theproposedinsertionsequenceprovestobefasterandmorestablethantheHilbertcurveorderandbiasedrandomizedinsertionorder(BRIO),especiallyfornon-uniformpointdistributionsoverawiderangeofbenchmarkexamples.
出版日期
2013年01月11日(中国期刊网平台首次上网日期,不代表论文的发表时间)