Results 91 to 100 of about 4,303,118 (363)

3D Elastomeric Kirigami for Passively Stretchable Fully Soft Vacuum‐Powered Artificial Muscles

open access: yesAdvanced Robotics Research, EarlyView.
The creation of purely soft, passively stretchable artificial muscles has long been a hot topic in robotics research. Here, we present a design approach involving the extension of 2D kirigami to 3D elastomeric kirigami structures. In a biomimetic demonstration of the human upper arm, this approach successfully simulated the driving mechanism ...
Tao Wang   +8 more
wiley   +1 more source

Points, cells, or polygons? On the choice of spatial units in forest conservation policy impact evaluation

open access: yesEnvironmental Research Letters
A fast-growing literature uses remotely sensed land-cover data along with quasi-experimental statistical methods to assess the efficacy of forest conservation interventions.
Allen Blackman   +2 more
doaj   +1 more source

Efficient visibility queries in simple polygons

open access: yesComputational Geometry, 2002
Die Autoren entwickeln Algorithmen zur Lösung des folgenden Sichtbarkeitsproblems und nahe verwandter Probleme: In der euklidischen Ebene \(E^2\) werden Polygone betrachtet (einfach zusammenhängende Teilmengen in \(E^2\), deren Rand eine geschlossene Kette von Strecken ist). Ein Polygon \(P\) wird durch seine aufeinanderfolgenden Ecken definiert; keine
Anna Lubiw, J. Ian Munro, Prosenjit Bose
openaire   +3 more sources

Multi‐Material Additive Manufacturing of Soft Robotic Systems: A Comprehensive Review

open access: yesAdvanced Robotics Research, EarlyView.
This review explores the transformative role of multi‐material additive manufacturing (MMAM) in the development of soft robotic systems. It presents current techniques, materials, and design strategies that enable functionally graded and adaptive structures.
Ritik Raj   +2 more
wiley   +1 more source

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons

open access: yes, 2018
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their ...
Boomari, Hossein   +2 more
core  

TacScope: A Miniaturized Vision‐Based Tactile Sensor for Surgical Applications

open access: yesAdvanced Robotics Research, EarlyView.
TacScope is a compact, vision‐based tactile sensor designed for robot‐assisted surgery. By leveraging a curved elastomer surface with pressure‐sensitive particle redistribution, it captures high‐resolution 3D tactile feedback. TacScope enables accurate tumor detection and shape classification beneath soft tissue phantoms, offering a scalable, low‐cost ...
Md Rakibul Islam Prince   +3 more
wiley   +1 more source

Pick’s Theorem in Two-Dimensional Subspace of R3

open access: yesThe Scientific World Journal, 2015
In the Euclidean space R3, denote the set of all points with integer coordinate by Z3. For any two-dimensional simple lattice polygon P, we establish the following analogy version of Pick’s Theorem, kIP+1/2BP-1, where BP is the number of lattice points ...
Lin Si
doaj   +1 more source

Review and prospect of coal mine informatization constructio

open access: yesGong-kuang zidonghua, 2020
Based on the definition of coal mine informatization, the characteristics, typical problems and their representative solutions in different stages of coal mine informatization construction are reviewed, which include single machine(system) automation ...
DING Enjie   +3 more
doaj   +1 more source

Packing identical simple polygons is NP-hard

open access: yes, 2012
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.
Allen, Sarah R., Iacono, John
core  

Triangulating a simple polygon in linear time [PDF]

open access: yesDiscrete & Computational Geometry, 1991
The author gives an optimal linear time algorithm for triangulating on \(n\)-vertex simple polygon, thus a longstanding and basic open problem is settled. The underlying quite clear and intuitive ideas rely on the balanced divide and conquer, polygon cutting theorem and the plane separator theorem. However the full understanding of all details is a non-
openaire   +3 more sources

Home - About - Disclaimer - Privacy