10.1145/1064092.1064146Proceedings of the Annual Symposium on Computational Geometry356-363PACG
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider the p...
We study the problem of maximizing the overlap of two convex polytopes under translation in R d for ...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m n. We consider the pro...
Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion th...
Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion th...
AbstractGiven two compact convex sets P and Q in the plane, we compute an image of P under a rigid m...
We present an algorithm to compute an approximate overlap of two convex polytopes P_1 and P_2 in R^3...
Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...
Let A and B be two sets of n resp. m (m n) disjoint unit disks in the plane. We consider the proble...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the p...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider the p...
We study the problem of maximizing the overlap of two convex polytopes under translation in R d for ...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m n. We consider the pro...
Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion th...
Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion th...
AbstractGiven two compact convex sets P and Q in the plane, we compute an image of P under a rigid m...
We present an algorithm to compute an approximate overlap of two convex polytopes P_1 and P_2 in R^3...
Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...
Let A and B be two sets of n resp. m (m n) disjoint unit disks in the plane. We consider the proble...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider th...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the p...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m > n. We consider the p...
We study the problem of maximizing the overlap of two convex polytopes under translation in R d for ...
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m n. We consider the pro...
DOI
Add to ORKG