Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions

katusaki Kawachi; Hiromasa Suzuki

首页> 外文期刊>精密工学会誌 >Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions

【24h】

Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions

机译：基于离散Voronoi区域的非凸多面体之间的距离计算

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between two polyhedra, it is important to search efficiently the pair of the triangles which gives the pair of closest points. In this paper discrete Voronoi regions are prepared as voxels around non-convex polyhedra. Each voxel is given a list of triangles which have possibility to be closest to the voxel.

机译：描述了一种用于计算非凸多面体之间的最小距离的算法。多面体由一组三角形表示。在计算两个多面体之间的距离时，重要的是要有效地搜索给出一对最接近点的三角形对。在本文中，离散的Voronoi区域被准备为围绕非凸多面体的体素。每个体素都有一个三角形的列表，这些三角形可能最接近该体素。

著录项

来源
《精密工学会誌》 |2001年第11期|p.1782-1786|共5页
作者
katusaki Kawachi; Hiromasa Suzuki;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 jpn
中图分类机械制造工艺;仪器、仪表;
关键词
computational geometry; distance computation; voronoi region;

机译：计算几何;距离计算;沃罗诺伊地区;

相似文献

外文文献
中文文献
专利

1. Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions [J] . katusaki Kawachi, Hiromasa Suzuki 精密工学会誌 . 2001,第11期

机译：基于离散Voronoi区域的非凸多面体之间的距离计算
2. A High-Speed VLSI Design and ASIC Implementation for Constructing Euclidean Distance-Based Discrete Voronoi Diagram [J] . N. Sudha, K. Sridharan IEEE Transactions on Robotics and Automation . 2004,第2期

机译：基于欧氏距离的离散Voronoi图的高速VLSI设计和ASIC实现
3. GPU-based computation of discrete periodic centroidal Voronoi tessellation in hyperbolic space [J] . Liang Shuai, Xiaohu Guo, Miao Jin Computer-Aided Design . 2013,第2期

机译：双曲线空间中基于GPU的离散周期质心Voronoi镶嵌的计算
4. Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions [C] . Kawachi, K., Suzuki, Geometric Modeling and Processing 2000. Theory and Applications. Proceedings . 2000

机译：基于离散Voronoi区域的短距离非凸多面体之间的距离计算
5. GEOMETRIC COMPLEXITY IN LOCATION AND DISTANCE PROBLEMS (COMPUTATIONAL, DIAGRAM, SHORTEST PATH, VORONOI). [D] . WU, YING-FUNG. 1986

机译：位置和距离问题中的几何复杂性（计算，图，最短路径，沃罗尼）。
6. Voronoi distance based prospective space-time scans for point data sets: a dengue fever cluster analysis in a southeast Brazilian town [O] . Luiz H Duczmal, Gladston JP Moreira, Denise Burgarelli, 2011

机译：基于Voronoi距离的点数据集的预期时空扫描：巴西东南部城镇的登革热聚类分析
7. Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions. [O] . Katusaki KAWACHI, Hiromasa SUZUKI 2001

机译：基于离散Voronoi地区的非凸多面体距离计算。

Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions

摘要

著录项

相似文献

相关主题

期刊订阅