Pages that link to "Item:Q861306"

The following pages link to Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306):

Displaying 6 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)
• On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types (Q4965106) (← links)
• A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls (Q4997435) (← links)