The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Comparison of viewshed algorithms on regular spaced points
Abstract
Viewshed is a basic visibility structure and represents all visible points from a given viewpoint. The paper gives a survey of non-parallel viewshed algorithms using regular spaced points. At first, a comprehensive background of the problem is given, then the existing methods (R3, R2, XDraw, method based on the line rasterisation) are introduced briefly. They have been implemented in 11 variants. Real terrain data and fractal generated terrains have been used for their comparison against spent CPU time and the accuracy of a computed visibility information.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“to date there been little in the way of consensus as to which offers the best way forward and no rigorous formal comparison with regard to the accuracy of the solutions tendered”
From Mapping invisibility: GIS approaches to the analysis of hiding and seclusion (2015) · cites this paper as Kaučič, B. and Žalik 2002
Citations
Cites
Barnsley, M. F., Devaney, R. L., Mandelbrot, B. B., Peitgen, H.-O., Saupe, D., & Voss, R. F. (1988) · Springer eBooks · doi:10.1007/978-1-4612-3784-6 · Cited by 1,611
Sadagopan, S. (2002) · Ubiquity · doi:10.1145/504689.504690 · Cited by 1,377
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90169-9 · Cited by 153
Applications of Computational Geometry to Geographic Information Systems
Floriani, L. D., Magillo, P., & Puppo, E. (2000) · Elsevier eBooks · doi:10.1016/b978-044482537-7/50008-5 · Cited by 85
Curve-drawing algorithms for Raster displays
Aken, J. R. V., & Novak, M. (1985) · ACM Transactions on Graphics · doi:10.1145/282918.282943 · Cited by 85
Visibility and Dead-Zones in Digital Terrain Maps
Cohen‐Or, D., & Shaked, A. (1995) · Computer Graphics Forum · doi:10.1111/1467-8659.1430171 · Cited by 47
Research works printed but not linked: 6
- 10.1111/j.1467-8659.1995.cgf143_0171.x · doi:10.1111/j.1467-8659.1995.cgf143_0171.x
- Leila De Floriani , Paola Magillo . Intervisibility on Terrains , Geographic Information Systems: Principles, Techniques, Management and Applications, Longley P.A., Goodchild M.F., Maguire D.J., Rhind D.W. (eds) , John Wiley & Sons , pp. 543 - 556 , 1999 . Leila De Floriani, Paola Magillo. Intervisibility on Terrains, Geographic Information Systems: Principles, Techniques, Management and Applications, Longley P.A., Goodchild M.F., Maguire D.J., Rhind D.W. (eds), John Wiley & Sons, pp. 543-556, 1999.
- Wm Randolph Franklin , Clark K. Ray , Shashank Mehta . Geometric Algorithms for Sitting of Air Defense Missile Batteries , Research Project for Battelle , Columbus Division , Contract Number DAAL03-86-D-0001, Delivery Order Number 2756, 1994 Wm Randolph Franklin, Clark K. Ray, Shashank Mehta. Geometric Algorithms for Sitting of Air Defense Missile Batteries, Research Project for Battelle, Columbus Division, Contract Number DAAL03-86-D-0001, Delivery Order Number 2756, 1994
- Wm Randolph Franklin , Clark K. Ray . Higher isn't Necessarily Better : Visibility Algorithms and Experiments , Advances in GIS Research: Proceedings of the 6th International Symposium on Spatial Data Handling, Waugh T.C., Healey R.G., (eds) , Edinburgh, UK , pp. 751 - 770 , 1994 . Wm Randolph Franklin, Clark K. Ray. Higher isn't Necessarily Better: Visibility Algorithms and Experiments, Advances in GIS Research: Proceedings of the 6th International Symposium on Spatial Data Handling, Waugh T.C., Healey R.G., (eds), Edinburgh, UK, pp. 751-770, 1994.
- Branko Kaučič , Borut Zalik . An Overview of Visibility Problem Algorithms in 1,5D , Proceedings of the 10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision '2002 , Skala V. (ed ) pp. 241 - 247 , 2002 . Branko Kaučič, Borut Zalik. An Overview of Visibility Problem Algorithms in 1,5D, Proceedings of the 10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision '2002, Skala V. (ed) pp. 241-247, 2002.
- Tomaz Trobec , Borut Zalik , Nikola Guid . Two Algorithms for Visibility Determination of Raster Relief Models , Spring Conference on Computer Graphics SCCG'98 , Kalos L.S. (ed), Budmerice, Slovak Republic , pp. 247 - 256 , 1998 . Tomaz Trobec, Borut Zalik, Nikola Guid. Two Algorithms for Visibility Determination of Raster Relief Models, Spring Conference on Computer Graphics SCCG'98, Kalos L.S. (ed), Budmerice, Slovak Republic, pp. 247-256, 1998.
Cited by
Mapping invisibility: GIS approaches to the analysis of hiding and seclusion
Gillings, M. (2015) · Journal of Archaeological Science · doi:10.1016/j.jas.2015.06.015 · Cited by 71
Metadata
- Authors
- Kaučič, B., & Zalik, B.
- Affiliations
- University of Maribor, Slovenia
- Venue
- Proceedings of the 18th Spring Conference on Computer Graphics
- Publisher
- ACM
- Published
- 2002-04-24
- Pages
- 177-183
- Cited by
- 17
- References
- 6
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparison of viewshed algorithms on regular spaced points. https://app.cochat.ai/papers/10.1145/584458.584487
- The paper
- Kaučič, B., & Zalik, B. (2002). Comparison of viewshed algorithms on regular spaced points. Proceedings of the 18th Spring Conference on Computer Graphics. https://doi.org/10.1145/584458.584487
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
