Let P be a simple polygon with n vertices. We present a new O(n)-time algorithm to compute the visible part of one edge from another edge of P . The algorithm does not alter the input and only uses O(1) variables and is therefore a constant-workspace algorithm. The algorithm can be used to make a constant-workspace algorithm for computing the weak visibility polygon from an edge in O(mn) time, ...

The paper addresses the optimal design of parallel manipulators based on multi-objective optimization. The objective functions used are: Global Conditioning Index (GCI), Global Payload Index (GPI), and Global Gradient Index (GGI). These indices are evaluated over a required workspace which is contained in the complete workspace of the parallel manipulator. The objective functions are optimized ...

In recent years, deep learning has steadily improved the state of art in artificial intelligence (AI), but mainly for single, well-defined tasks or challenges. Novel advanced neural network architectures, possibly inspired by neuroscience, are needed to create more general-purpose AI systems with flexible and robust capabilities. The Global Workspace Theory (GWT), introduced over 30 years ago, ...

SUMMARY Automatic optimum network design for measuring complex industrial objects by vision metrology systems is a real challenge. In the absence of 3D simulated CAD models of the complex objects along with the absence of workspace information, several uncertain parameters are introduced into the camera placement decision-making process. These uncertain factors include the vision constraints su...

The workspace of manipulator can be defined as the operational area of the end effector. Because the moving platform of the parallel manipulator with six degree-of-freedom have six independence degree-offreedoms, it means the workspace has six-dimensional, the six-dimensional workspace is difficult to be directly calculated and unable to do graphic description. For the project of this article-3...