Add to ORKGTheme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1996 n.2832 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
[To85b] Toussaint, G. T., “New results in computational geometry relevant to pattern recognitio
10.1145/1064092.1064146Proceedings of the Annual Symposium on Computational Geometry356-363PACG
AbstractGiven two convex polyhedra P and Q in three-dimensional space, we consider two related probl...
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertice...
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let P and Q be two simple polygons in the plane of total complexity n, each of which can be decompos...
We study the problem of maximizing the overlap of two convex polytopes under translation in R d for ...
We study the problem of maximizing the overlap of two convex polytopes under translation in ℝ<sup>d<...
We study the problem of maximizing the overlap of two convex polytopes under translation in R-d for ...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
We study the problem of maximizing the overlap of two convex polytopes under translation in R-d for ...
Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...
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...
[To85b] Toussaint, G. T., “New results in computational geometry relevant to pattern recognitio
10.1145/1064092.1064146Proceedings of the Annual Symposium on Computational Geometry356-363PACG
AbstractGiven two convex polyhedra P and Q in three-dimensional space, we consider two related probl...
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertice...
Let P be a convex polygon in the plane with n vertices and let Q be a convex polygon with m vertices...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
Let P and Q be two simple polygons in the plane of total complexity n, each of which can be decompos...
We study the problem of maximizing the overlap of two convex polytopes under translation in R d for ...
We study the problem of maximizing the overlap of two convex polytopes under translation in ℝ<sup>d<...
We study the problem of maximizing the overlap of two convex polytopes under translation in R-d for ...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
We study the problem of maximizing the overlap of two convex polytopes under translation in R-d for ...
Theme 2 - Genie logiciel et calcul symbolique. Projet PrismeSIGLEAvailable from INIST (FR), Document...
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...
[To85b] Toussaint, G. T., “New results in computational geometry relevant to pattern recognitio
10.1145/1064092.1064146Proceedings of the Annual Symposium on Computational Geometry356-363PACG
AbstractGiven two convex polyhedra P and Q in three-dimensional space, we consider two related probl...