Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6082038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing best coverage path in the presence of obstacles in a sensor field |
scientific article; zbMATH DE number 6082038 |
Statements
Algorithms for computing best coverage path in the presence of obstacles in a sensor field (English)
0 references
13 September 2012
0 references
sensor network
0 references
coverage problem
0 references
Voronoi diagram
0 references
visibility graph
0 references
spanner
0 references
0.951589286327362
0 references
0.698286771774292
0 references
0.6963658332824707
0 references
