Imagine having a continuum soft robotic arm bend around a bunch of grapes or broccoli, adjusting its grip in real time as it lifts the object. Unlike traditional rigid robots that generally aim to ...

I would like to add the Rotating Calipers algorithm under the geometry package. This algorithm provides geometric computations for convex polygons, including: Diameter – the largest distance between ...

Abstract: For autonomous or highly automated ships, it is important to have an accurate picture of all static and dynamic obstacles in a wide area in order to have enough time and space to avoid them.

At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...

Abstract: The Online Bin Packing Problem (OBPP) aims to determine the optimal loading position for each incoming item to maximize bin utilization, a critical challenge in various industrial ...

Abstract: Instance segmentation of overlapping objects in biomedical images remains a largely unsolved problem. We take up this challenge and present MultiStar, an extension to the popular instance ...

The purpose of the project was to develop a program in C++ and OpenGL for the creation of arbitrary convex polygons, with the possibility of dynamic modification of the number of sides by the user in ...