Results 31 to 40 of about 5,737 (222)
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem.
Aichholzer, Oswin +5 more
core +2 more sources
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
Coverage path planning considering the cell number and starting position
The coverage tasks of mobile robots are evolving towards large-scale and intelligent directions, demanding urgent requirements for the coverage efficiency and environmental adaptability of coverage path planning. To address the inadequate adaptability of
MA Mingyan +4 more
doaj +1 more source
Deconstructing Approximate Offsets [PDF]
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius?
Berberich, Eric +3 more
core +2 more sources
Adaptive Path Planning for Depth Constrained Bathymetric Mapping with an Autonomous Surface Vessel
This paper describes the design, implementation and testing of a suite of algorithms to enable depth constrained autonomous bathymetric (underwater topography) mapping by an Autonomous Surface Vessel (ASV).
Cover TM +11 more
core +1 more source
A strongly monotonic polygonal Euler scheme
In recent years tamed schemes have become an important technique for simulating SDEs and SPDEs whose continuous coefficients display superlinear growth. The taming method, which involves curbing the growth of the coefficients as a function of stepsize, has so far however not been adapted to preserve the monotonicity of the coefficients. This has arisen
Johnston, Tim, Sabanis, Sotirios
openaire +2 more sources
Structural Colors from Ultrathin Lignin Films
Thickness‐dependent structural colors in ultrathin lignin films generate a full visible palette, tuned simply by solution concentration and spin speed. Abstract Structural colors offer a sustainable alternative to toxic pigments and dyes, yet their realization from lignin, the most abundant aromatic biopolymer, has remained elusive.
Bang An +6 more
wiley +1 more source
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation.
A Pilz +19 more
core +1 more source
Multi‐Material Additive Manufacturing of Soft Robotic Systems: A Comprehensive Review
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
A fully edible soft electrode is engineered from Ca2⁺‐crosslinked alginate integrated with polydopamine, silver nanoparticles, and food‐grade glucose oxidase. The hybrid hydrogel combines ionic and electronic conduction, enabling efficient glucose‐to‐H2O2 conversion and catalytic reduction in simulated intestinal fluid.
Verdiana Marchianò +10 more
wiley +1 more source

