Methods, systems, articles of manufacture and apparatus for clustering vertices of an N-dimensional regular polygon using bearing angles

1. An apparatus for clustering vertices, the apparatus comprising:

interface circuitry;

machine-readable instructions; and

at least one processor circuit to be programmed by the machine-readable instructions to:

assign first coordinates to a vehicle, the vehicle to collect data from entities located at respective ones of the first coordinates;

based on a reassignment trigger, calculate a centroid corresponding to the first coordinates;

calculate distances for respective ones of the first coordinates relative to the centroid;

in response to determining that ones of the distances satisfy a threshold:

calculate bearing angles for ones of the first coordinates;

sort respective ones of the bearing angles based on angle values; and

automatically reassign second coordinates to the vehicle based on relatively lowest ones of the sorted bearing angles, the reassignment to cause re-routing of the vehicle.

2. The apparatus of claim 1 , wherein the first coordinates are related to at least one of a store location, a group of stores, or a site location.

3. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to perform vertex clustering on an n-dimensional regular polygon using the sorted bearing angles.

4. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to identify an increase in the efficiency metric corresponding to a decrease in the bearing angles for ones of the first coordinates.

5. The apparatus of claim 1 , wherein the threshold includes a minimum threshold and a maximum threshold indicating whether the first coordinates are arranged as an n-dimensional regular polygon.

6. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to calculate the bearing angles by tracking an angle of ones of the first coordinates, the angle of ones of the first coordinates measured counterclockwise from a first orientation location.

7. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to form coordinate clusters based on a determination of minimum bearing angles of the sorted bearing angles, the minimum bearing angles associated with coordinate pairs to be clustered together.

8. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to:

in response to determining that ones of the distances do not satisfy the threshold:

determine an efficiency metric associated with ones of the distances;

sort ones of the calculated distances based on the associated efficiency metric; and

form coordinate clusters based on the sorted distances.

9. At least one non-transitory computer readable medium comprising computer-readable instructions to cause a at least one processor circuit to at least:

assign first coordinates to a vehicle, the vehicle to collect data from entities located at respective ones of the first coordinates;

based on a reassignment trigger, calculate a centroid corresponding to the first coordinates;

calculate distances for respective ones of the first coordinates relative to the centroid;

in response to determining that ones of the distances satisfy a threshold:

calculate bearing angles for ones of the first coordinates;

sort respective ones of the bearing angles based on angle values; and

automatically reassign second coordinates to the vehicle based on the sorted bearing angles, the reassignment to cause re-routing of the vehicle.

10. The at least one non-transitory computer readable medium of claim 9 , wherein the first coordinates are related to at least one of a store location, a group of stores, or a site location.

11. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions are to cause one or more of the at least one processor circuit to perform vertex clustering on an n-dimensional regular polygon using the sorted bearing angles.

12. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions are to cause one or more of the at least one processor circuit to identify an increase in the efficiency metric corresponding to a decrease in the bearing angles for ones of the first coordinates.

13. The at least one non-transitory computer readable medium of claim 9 , wherein the threshold includes a minimum threshold and a maximum threshold indicating whether the first coordinates are arranged as an n-dimensional regular polygon.

14. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions are to cause one or more of the at least one processor circuit to calculate the bearing angles by tracking an angle of ones of the first coordinates, the angle of ones of the first coordinates measured counterclockwise from a first orientation location.

15. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions are to cause one or more of the at least one processor circuit to sort the bearing angles in ascending order.

16. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions are to cause one or more of the at least one processor circuit to form coordinate clusters based on a determination of minimum bearing angles of the sorted bearing angles, the minimum bearing angles associated with coordinate pairs to be clustered together.

17. The at least one non-transitory computer readable medium of claim 9 , wherein the computer-readable instructions to cause one or more of the at least one processor circuit to:

in response to determining that ones of the distances do not satisfy the threshold:

determine an efficiency metric associated with ones of the distances;

sort ones of the calculated distances based on the associated efficiency metric; and

form coordinate clusters based on the sorted distances.