学科分类
/ 1
1 个结果
  • 简介:Wetackletheproblemofconstructing2DcentroidalVoronoitessellationswithconstraintsthroughanefficientandrobustconstructionofboundedVoronoidiagrams,thepseudo-dualoftheconstrainedDelaunaytriangulation.WeexploitthefactthatthecellsoftheboundedVoronoidiagramcanbeobtainedbyclippingtheordinaryonesagainsttheconstrainedDelaunayedges.Theclippingitselfisefficientlycomputedbyidentifyingforeachconstrainededgethe(connected)setoftriangleswhosedualVoronoiverticesarehiddenbytheconstraint.TheresultingconstructionisamenabletoLloydrelaxationsoastoobtainacentroidaltessellationwithconstraints.

  • 标签: VORONOI图 约束Delaunay三角网 二维 隐藏设置 三角形 约束边