• We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.

    每次向树中添加顶点后,都要遍历优先级队列查找并删除这样的边。

    youdao

  • To simplify the 3D color head dataset acquired from 3D color laser scanner, a new vertex merging mesh simplification algorithm based on region segmentation is presented.

    针对三维激光扫描仪获得的彩色人头数据集压缩问题,提出了基于区域分割的顶点合并网格简化算法。

    youdao

  • To simplify the 3D color head dataset acquired from 3D color laser scanner, a new vertex merging mesh simplification algorithm based on region segmentation is presented.

    针对三维激光扫描仪获得的彩色人头数据集压缩问题,提出了基于区域分割的顶点合并网格简化算法。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定