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 ...

This repository contains a number of algorithms for solving the problem of finding a convex polygon with bounded area, containing as many points as possible, also known as the Bounded Area Maximum ...

In this paper, we present a full coverage path planning (CPP) algorithm for the marine surveys conducted in the convex polygon shaped search area. The survey is supposed to carry out by torpedo-type ...

Abstract: This contribution describes a novel and fully projective algorithm for a point-in-convex polygon test with computational complexity of O(log N) in E 2. The polygon vertices and tested points ...

Abstract: As the most precise interval analysis (IA) method in antenna/radome areas, convex-polygon-based IA suffers from the exponentially increasing computational complexity with antenna/radome ...