Minimal arithmetic thickness connecting discrete planes
Minimal arithmetic thickness connecting discrete planes
复制标题
连接离散平面的最小算术厚度
DOI：
10.1016/j.dam.2008.05.027
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Jean
中科院分区：
文献类型：
--
作者：
D. Jamet;Jean
虽然连通算术离散线的特点是完全，只有部分结果存在更一般的情况下，算术离散超平面。在本文中，我们专注于三维的情况下，即算术离散平面。由于算术减少一个向量n，我们提供的算法，以确定是否一个给定的算术离散平面与n作为法向量连接，或计算最小厚度的算术离散平面与法向量n连接。
While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.