Pages that link to "Item:Q861306"
From MaRDI portal
The following pages link to Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306):
Displaying 4 items.
- Optimal circle covering problems and their applications (Q302130) (← links)
- Optimal 2-coverage of a polygonal region in a sensor network (Q1662495) (← links)
- The connected disk covering problem (Q1702836) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
