Name
Abstract | ||
|---|---|---|
The selection of the minimal number of observers that ensures the maximum visual coverage over an area represented by a digital elevation model (DEM) have great interest in many fields, e.g., telecommunications, environment planning, among others. However, this problem is complex and intractable when the number of points of the DEM is relatively high. This complexity is due to three issues: 1) the difficulty in determining the visibility of the terrain from one point, 2) the need to know the visibility at all points of the terrain and 3) the combinatorial complexity of the selection of observers. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.procs.2015.05.255 | Procedia Computer Science |
Keywords | Field | DocType |
Maximun coverage,Optimal located of observes,Total visibility model | Data mining,Mathematical optimization,Visibility,Computer science,Terrain,Combinatorial complexity,Viewshed analysis,Digital elevation model,Need to know,Computation | Conference |
Volume | ISSN | Citations |
51 | 1877-0509 | 4 |
PageRank | References | Authors |
0.47 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cervilla, A.R. | 1 | 10 | 1.74 |
| Siham Tabik | 2 | 167 | 18.92 |
| Luis F. Romero | 3 | 32 | 8.89 |