Separability of pairs of polygons through single translations‡

Publisher： Cambridge University Press

E-ISSN： 1469-8668|5|1|55-63

ISSN： 0263-5747

Source： Robotica, Vol.5, Iss.1, 1987-01, pp. : 55-63

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the elimination of branching in the synthesis of spatial single-loop mechanisms with lower pairs

By  

Robotica, Vol. 6, Iss. 2, 1988-04 ,pp. : 149-154

Cambridge University Press

Access to resources Recommend Favorite

Identifying High Quality Document–Summary Pairs through Text Matching

By Hou Yongshuai   Xiang Yang   Tang Buzhou   Chen Qingcai   Wang Xiaolong   Zhu Fangze  

Information, Vol. 8, Iss. 2, 2017-06 ,pp. : 64-64

MDPI

Access to resources Recommend Favorite

Separation of two monotone polygons in linear time

By  

Robotica, Vol. 2, Iss. 4, 1984-10 ,pp. : 215-220

Cambridge University Press

Access to resources Recommend Favorite

Algorithms for computing intersection and union of toleranced polygons with applications

By  

AI EDAM, Vol. 11, Iss. 4, 1997-09 ,pp. : 263-272

Cambridge University Press

Access to resources Recommend Favorite

Improving the Separability of Deep Features with Discriminative Convolution Filters for RSI Classification

By Liu Na   Lu Xiankai   Wan Lihong   Huo Hong   Fang Tao  

ISPRS International Journal of Geo-Information, Vol. 7, Iss. 3, 2018-03 ,pp. : 95-95

MDPI

Access to resources Recommend Favorite