1 citations · 2 across the 6 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2020
An integer programming formulation using convex polygons for the convex partition problem
Hadrien Cambazard, Nicolas Catusse
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a c…
cs.CG2011
Bidirected minimum Manhattan network problem
Nicolas Catusse, Victor Chepoi, Karim Nouioua +1
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that t…