Source localization is of great importance for wireless sensor network applications. Locating emission sources using received signal strength (RSS) measurements is investigated in this paper. As RSS ...

Detecting oriented and densely packed objects is a challenging problem considering that the receptive field intersection between objects causes spatial feature aliasing. In this paper, we propose a ...

This paper proposes a methodology in the context of convex geometry theory aiming to reduce the number of satellites among all visible satellites used for the position computation by a navigation ...

A polygon (convex or not) is regular if it is uniform and its faces are all alike. The regular convex polyhedra are the five Platonic solids, which have been known since classical Greece.

Therefore, several cloud properties (including irregularity in shape) have been considered in finding the communication feasible polygon (CFP). To perform convex optimization of the UAV trajectory, ...

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

In this paper we aim to bring new approach into usage of Shoelace Algorithm for area calculation in convex polygons on Cartesian coordinate system, with concentration on point in polygon concept.

An algorithm that finds the externally visible vertices of a polygon is described. This algorithm generates a new geometric construction, termed the convex ropes of each visible vertex. The convex ...

This article proposes a prescribed-time distributed convex polygon entrapping control protocol based on relative measurements for leader-follower-constructed autonomous aerial vehicles (AAVs). A group ...