Computational Geometry and Swift

Completado Publicado hace 6 años Pagado a la entrega
Completado Pagado a la entrega

The task is to write a simple command line application which solves a geometry problem of intersection of a half-planes in 2-dimensions with asymptotic complexity O(n * log n).

Please use the Divide-and-Conquer algorithm. The intersection of polygons in this algorithm should be done using a sweep line.

Each half-plane is described with 4 numbers: two coordinates of a point which belongs to a dividing line and two coordinates of a vector which describes the direction of this line.

Input -- text file which contains those 4 numbers in each row.

Output -- ordered Indices of half-planes which belongs to resulting polygon. (or coordinates of vertices of resulting polygon)

Matemáticas Swift

Nº del proyecto: #13965435

Sobre el proyecto

7 propuestas Proyecto remoto Activo hace 6 años

Adjudicado a:

Logal

Hello I am an engineer who likes maths and programming I can solve your problem and answer any question about it

$133 USD en 2 días
(1 comentario)
2.2

7 freelancers están ofertando un promedio de $195 por este trabajo

dobreiiita

Hello I am Algorithm expert and interested in this project. I have reviewed the details of the algorithm and confident to handle it perfectly. I will keep codes well documented and simple. Please communicate to Más

$120 USD en 2 días
(61 comentarios)
5.0
reddysir2016

Experts from IIT India ‘Dedicated Developer Service’ gives you access to Single or team of Dedicated Developers / Programmers, exclusively working for you on your projects at our software development outsourcing center Más

$155 USD en 3 días
(0 comentarios)
0.0