Wetackletheproblemofconstructing2DcentroidalVoronoitessellationswithconstraintsthroughanefficientandrobustconstructionofboundedVoronoidiagrams,thepseudo-dualoftheconstrainedDelaunaytriangulation.WeexploitthefactthatthecellsoftheboundedVoronoidiagramcanbeobtainedbyclippingtheordinaryonesagainsttheconstrainedDelaunayedges.Theclippingitselfisefficientlycomputedbyidentifyingforeachconstrainededgethe(connected)setoftriangleswhosedualVoronoiverticesarehiddenbytheconstraint.TheresultingconstructionisamenabletoLloydrelaxationsoastoobtainacentroidaltessellationwithconstraints.
