Traditionally 3d models have been made from data describing information on a regular grid, like the grid of pixels on a monitor.
传统的3d模型像显示器中的像素网格一样,是在规则的网格中由描述信息的数据所构成。
This paper analyses a regular grid network for two kinds of routing standard theoretically, and derives recursive formular to find the network performance.
本文对一种规则的栅格状网络进行了理论分析,并分别针对两种路由准则,采用递归方法推导出了评价网络性能的计算公式。
In the first model they observe the co-occurrence of keywords with image regions which are created using a regular grid. And they annotate the images by the association probability.
共现模型将图像划分成规则区域,根据图像区域和关键词的共现概率来标注图像,即观察关键词与图像区域的联合发生概率。
应用推荐