Visibility problems for polyhedral terrains

Journal of Symbolic Computation

Volumn 7, Issue 1, 1989, Pages 11-30

  Cole, Richard ^a   Sharir, Micha ^a,b  

^a NEW YORK UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002698834     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(89)80003-3     Document Type: Article

References (21)

1. Dynamic computational geometry
2. Fractional cascading: I. A data structuring technique
3. Visibility and intersection problems in plane geometry
4. A combinatorial theorem in plane geometry
5. Searching and storing similar lists
6. Making data structures persistent
7. A visibility-based model for terrain features
8. Quadratic bounds for hidden line elimination
9. Optimal point location in a monotone subdivision
10. Finding extreme points in three dimensions and solving the post-office problem in the plane
11. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons
12. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
13. Worst-case optimal hidden-surface removal
14. An algorithm for constructing the aspect graph
15. Finding the intersection of h half spaces in time O(n log n)
16. Almost linear upper bounds on the length of general Davenport-Schinzel sequences
17. Improved lower bounds on the length of Davenport-Schinzel sequences
18. Planar realization of nonlinear Davenport-Schinzel sequences by segments