Titlebook: WALCOM: Algorithms and Computation; 11th International C Sheung-Hung Poon,Md. Saidur Rahman,Hsu-Chun Yen Conference proceedings 2017 Spring

规章

最高峰

用树皮

Prologue

Bundling Two Simple Polygons to Minimize Their Convex Hull we find an optimal placement of . using linear space at the expense of slightly increased running time. For two polyhedra in three dimensional space, we find an optimal translation in . time using .(.) space or in . time using linear space.

步兵

Bundling Two Simple Polygons to Minimize Their Convex Hull we find an optimal placement of . using linear space at the expense of slightly increased running time. For two polyhedra in three dimensional space, we find an optimal translation in . time using .(.) space or in . time using linear space.