Terrain visibility

Computers and Graphics

Volumn 18, Issue 6, 1994, Pages 763-773

  Nagy, George ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037946665     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/0097-8493(94)90002-7     Document Type: Article

References (97)

1. A visibility-based model for terrain features
2. Hidden line elimination in projected grid surfaces
3. An optimal algorithm for determining the visibility of a polygon from an edge
4. Visibility between two edges of a simple polygon
5. PMAP, The professional map analysis package
6. A parallel algorithm for the visibility problem from a point
7. Visibility computation on a triangulated terrain
8. Optimum watchman routes
9. Visibility problems for polyhedral terrains
10. The Upper Klethia Valley: Computer generated maps of site location
11. A hierarchical structure for surface approximation
12. Delaunay-based representation of surfaces defined over arbitrarily shaped domains
13. Efficient selection, storage, and retrieval of irregularly distributed elevation data
14. Surface representations based on triangular grids
15. On sorting triangles on a Delaunay tesselation
16. Polyhedral terrain description using visibility criteria
17. Visibility characteristics of grey-scale images
18. Visibility related image features
19. Computing a line-of-sight network on a terrain model
20. Computing point visibility on a terrain based on a nested horizon structure
21. Visibility algorithms on triangulated terrain models
22. A note on two problems in connection with graphs
23. Viewblock: A computer program for constructing perspective view block diagrams
24. The upper envelope of piecewise linear functions: Algorithms and applications
25. The upper envelope of piecewise linear functions: Tight bounds on the number of faces
26. An acyclicity theorem for cell complexes in d-dimensions
27. Natural surface approximation by constrained stochastic interpolation
28. A feature-based approach to terrain surface approximation
29. A new method for the characterization of topographic surfaces
30. Discrete surface models: Constraint-based generation and understanding
31. Polyhedral surface decomposition based on curvature analysis
32. Geometric reasoning for the extraction of surface shapes
33. Landscape visibility
34. Simulation of the uncertainty of a viewshed
35. First experiments in viewshed uncertainty: The accuracy of the viewshed area
36. First experiments in viewshed uncertainty: Simulating fuzzy viewsheds
37. Probable and fuzzy models of viewshed operation
38. Algorithm and implementation uncertainty in viewshed analysis
39. Automatic extraction of irregular network digital terrain models
40. Formal methods for the accurate definition of some fundamental terms in physical geography
41. PRISM—A prism plotting program
42. Covering grids and orthogonal polygons with periscope guards
43. Geographical feature analysis using integrated information processing system
44. Digital detection of pits, peaks, ridges and ravines
45. Comparisons between algorithms for terrain visibility
46. A fast algorithm for Steiner Tree
47. The visual hull and its computation in 2-D
48. Comparison of existing methods for building triangular irregular network models of terrain from grid digital elevation models
49. Analysis of visibility sites on topographic surfaces
50. Visibility dominance and topographic features on digital elevation models
51. Sampling and isometric mapping of continuous cartographic surfaces
52. Worst-case optimal hidden-surface removal
53. Optimal motion of covisible points among obstacles in the plane
54. Watchman routes for multiple guards
55. Two-dimensional critical point configuration graphs
56. Autonomous navigation to provide long-distance surface traverses for Mars Rover sample return mission
57. A high-level description of digital terrain models using visibility information
58. Reconstruction of terrain features from horizons
59. The robber route problem
60. Visibility graphs
61. A new method for computing visibility graphs
62. Symbolic feature analysis and expert systems
63. Detection of surface specific points by local parallel processing of discrete terrain elevation data
64. The triangulated irregular network
65. Spectral analysis of landforms
66. A new way to see terrain
67. Representing Visibility for Siting Problems
68. An efficient output-sensitive hiddensurface removal algorithm and its parallelization
69. An optimal algorithm for detecting weak visibility of a polygon
70. Visibility and terrain labeling
71. Fast line-edge intersections on a uniform grid
72. The shortest watchtower and related problems for polyhedral terrains
73. Recent results in art galleries
74. A characterization of ten hidden-surface algorithms
75. Region-to-region visibility analysis using massively parallel hypercube machines
76. Parallel visibility analysis on digital terrain models
77. Visibility analysis on digital terrain models and its parallel implementation
78. Stealth terrain navigation
79. VIEWIT
80. Characteristics of visibility models
81. Visual impact analysis—A case study of a computer-based system
82. Hidden surface elimination using polygon area sorting