Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. We adapted an existing approach to identifying stabilizable crystal structures from ...

Is your feature request related to a problem or challenge? The Convex Hull algorithm is an essential concept in computational geometry, used to find the smallest convex polygon that encloses a given ...

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: Inverse Synthetic Aperture Radar (ISAR) images are extensively utilized in Radar Automatic Target Recognition (RATR). However, the target motion and the variations in the Line of Sight (LoS) ...

A new connection between human and machine learning has been discovered: While conceptual regions in human cognition for long have been modelled as convex regions, Tetkova et al. present new evidence ...

Hong Wang, an associate professor at NYU’s Courant Institute of Mathematical Sciences, presenting her work on the Kakeya conjecture on March 10, 2025. Credit: David Song/NYU. Professors from NYU and ...

They discussed methods for creating holograms using alternative projections and gradient descent. The goal was to help improve hologram generation and showcase recent progress in this quickly evolving ...

ABSTRACT: Proximal gradient descent and its accelerated version are resultful methods for solving the sum of smooth and non-smooth problems. When the smooth function can be represented as a sum of ...

Many kidney diseases are manifested by protein in the urine. However, until now it was not possible to determine whether the protein excretion is caused by only a few, but severely damaged, or by many ...