Geo location circle in cirlce packing

Em Andamento Postado há 4 anos Pago na entrega
Em Andamento Pago na entrega

Hi, we are looking for someone to solve our problem. It can be written in any programming language (typescript prefered) as a simple console application (no UI needed).

===============================================

The math problem is called "Circle overlapping in circle":

[login to view URL]:1586500707755&source=lnms&tbm=isch&sa=X&ved=2ahUKEwiUpfzYn93oAhXHGuwKHS3qCtEQ_AUoAXoECAsQAw&biw=1280&bih=616

The solution is maybe something like this: [login to view URL]~efriedma/circovcir/

[login to view URL]:279592288964621@1443671404507/[login to view URL]

===============================================

One solution could be to find a pattern and repeat this pattern:

Is (Radius A = Radius B / 2) ?

If we find a result from a is bigger than "Radius B / 2" we can stop, otherwise

Is (Radius A = Radius B / 4) ?

We repeat the pattern, if we find a result that its distance to the point is larger than "Radius B / 4" then we can stop otherwise we repeat the pattern with / 8, ... / 16 ... / 32

===============================================

A(Location) => Position[]

A takes a start location (center of search radius) as input parameter and searches for objects in a unkown search radius.

It returns them.

B(Location, SearchRadius) => Position[]

B takes a start location (center of search radius) and a search radius as input parameter and searches for objects in a known radius.

It returns them.

Function B needs to call function A to get positions.

B could look this:

B(Location, SearchRadius) => A(Location)

The problem:

If SearchRadius A is bigger then we need to remove positions that are outside of SearchRadius B.

If SearchRadius B is bigger then we need to call A more than once.

===============================================

Here you can start: [login to view URL]

Small annotation: If A finds no positions it's clear that we cannot determine the possible search radius. In this case it will search forever without stopping until it determines that the search radius is smaller than 5 meters (this should be changeable). You can also make an async function with a callback if you want.

The solution should have best perfomance approach.

Geologia Geolocalização Geographical Information System (GIS) Typescript JavaScript

ID do Projeto: #24922105

Sobre o projeto

1 proposta Projeto remoto Ativo em há 4 anos

Concedido a:

mts727

Hi there, I have understood your problem to a greater extent. Now i have two options for you: 1) I design an implement this solution using C++(Will be more reliable, fast and accurate) 2) Or Using pure JavaScript (N Mais

$25 USD em 5 dias
(0 Comentários)
0.0