2019 18th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES) 2019
DOI: 10.1109/dcabes48411.2019.00026
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Multiple Viewshed Algorithm for Region Partitioning for Filtering Candidate Viewpoints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…For instance, a technique for reducing the number of viewpoints for the maximum coverage over an entire area (total viewshed), assuming that peaks are the ideal viewpoints for maximum coverage, has been developed [17]. Likewise, a similar approach toward applications where the total viewshed is the key issue continues to be developed [18]. However, there is limited research on systematic techniques, particularly those assessed with empirical data that identify how to select optimal key observation points, with a recent exception that addresses this shortfall [19].…”
Section: Introductionmentioning
confidence: 99%
“…For instance, a technique for reducing the number of viewpoints for the maximum coverage over an entire area (total viewshed), assuming that peaks are the ideal viewpoints for maximum coverage, has been developed [17]. Likewise, a similar approach toward applications where the total viewshed is the key issue continues to be developed [18]. However, there is limited research on systematic techniques, particularly those assessed with empirical data that identify how to select optimal key observation points, with a recent exception that addresses this shortfall [19].…”
Section: Introductionmentioning
confidence: 99%