I'm working on an App based on this Klaus example.
I work on 2500 markers and 22 polygons.
the application examines the markers and tells me inside which polygon that marker falls.
I used several algorithms (which I found on the forum) which reveal to me if a gps position (lat, lon) is inside a polli apli until I found one that reduces my time by about 1/6.
Adesos I did other tests, doing the same analysis by filling out the Application with JDK8, OpenJDK11 and OpenJDK14.
Ecoc the times of caolcolo for the 2500 markers:
JDK8: 41ms
OpenJDK11: 43ms
OpenJDK14: 49ms
I found it odd that later versions are slightly slower. What do you think?
I work on 2500 markers and 22 polygons.
the application examines the markers and tells me inside which polygon that marker falls.
I used several algorithms (which I found on the forum) which reveal to me if a gps position (lat, lon) is inside a polli apli until I found one that reduces my time by about 1/6.
Adesos I did other tests, doing the same analysis by filling out the Application with JDK8, OpenJDK11 and OpenJDK14.
Ecoc the times of caolcolo for the 2500 markers:
JDK8: 41ms
OpenJDK11: 43ms
OpenJDK14: 49ms
I found it odd that later versions are slightly slower. What do you think?