规章 发表于 2025-4-2 22:32:25

http://reply.papertrans.cn/103/10201/1020042/1020042_71.png

最高峰 发表于 2025-4-3 02:06:07

http://reply.papertrans.cn/103/10201/1020042/1020042_72.png

用树皮 发表于 2025-4-3 04:35:20

http://reply.papertrans.cn/103/10201/1020042/1020042_73.png

Prologue 发表于 2025-4-3 10:20:52

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.

步兵 发表于 2025-4-3 15:16:57

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.
页: 1 2 3 4 5 6 7 [8]
查看完整版本: Titlebook: WALCOM: Algorithms and Computation; 11th International C Sheung-Hung Poon,Md. Saidur Rahman,Hsu-Chun Yen Conference proceedings 2017 Spring