会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明授权
    • Method of searching for points of closest approach, and preprocessing
method therefor
    • 搜索最接近点的方法及其预处理方法
    • US5675720A
    • 1997-10-07
    • US710550
    • 1996-09-19
    • Yuichi SatoMitsunori HirataTsugito MaruyamaFumio Nagashima
    • Yuichi SatoMitsunori HirataTsugito MaruyamaFumio Nagashima
    • G06T17/00G06T17/20
    • G06T17/20G06T17/00Y10S345/958
    • A method of searching for a point of closest approach between two convex polyhedrons K.sub.1, K.sub.2, wherein each convex polyhedron is expressed by creating directed-graph structure data. The method uses a processing unit for searching for points of closest approach. The method includes the step of successively obtaining points of closest approach to a difference convex polyhedron, which is a difference of sets (K.sub.1 -K.sub.2) between the two convex polyhedrons K.sub.1, K.sub.2, and finally obtaining the point of closest approach on each convex polyhedron K.sub.1, K.sub.2. In the evaluation of inner products executed in the course of searching for points of closest approach, the method further includes the step of judging whether the point of closest approach on each convex polyhedron corresponding to the successively obtained point of closest approach to the difference convex polyhedron resides on a vertex, edge or polygon. This judging step is also performed by the processing unit. In each particular case, the vertices used in the inner-product evaluation are obtained from the directed-graph structure data and the inner product evaluation is performed using the position vectors of these vertices.
    • 搜索两个凸多面体K1,K2之间最接近的点的方法,其中每个凸多面体通过产生有向图结构数据来表示。 该方法使用处理单元来搜索最接近的点。 该方法包括以下步骤:连续获得最差接近差异凸多面体的点,该差异凸多面体是两个凸多面体K1,K2之间的集合(K1-K2)的差异,并且最终获得每个凸多面体最接近的点 K1,K2。 在对最接近点的搜索过程中执行的内部产品的评估中,该方法还包括以下步骤:判断每个凸多面体最接近的点对应于连续得到的差分凸多面体接近点 驻留在顶点,边缘或多边形上。 该判断步骤也由处理单元执行。 在每个特定情况下,从有向图结构数据中获得用于内部产品评价的顶点,并且使用这些顶点的位置向量来执行内部产品评估。