Algorithm for full coverage of points in an area?

F

F

FedOTs2018-07-11 03:02:30

Algorithms

FedOTs, 2018-07-11 03:02:30

Algorithm for full coverage of points in an area?

Good day,
There is a certain 2-dimensional area. Points are evenly distributed over this area.
We need an algorithm to completely cover these points.
I solved it using the Nearest Neighbor Method and the Kruskal Algorithm. But it doesn't always work out so well.
Are there good algorithms?

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

0 answer(s)

Similar questions

V

Vladimir Sokolovsky2015-12-11 10:28:18

Search for a solution to a problem that is not similar to the previous ones. Is there an ideal algorithm? 10Reply

G

Grizmar2015-12-11 16:05:55

How to check if one of the phrases occurs in the text? 4Reply

P

Pavel2015-12-18 09:33:35

How can you find the vertex cover of a graph in linear time if the graph is a tree? 1Reply

S

Silm2015-12-20 20:47:56

What to study according to the general principles of building ratings, voting, etc? 3Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question