Visibility problems for polyhedral terrains
Open Access
- 1 January 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 7 (1) , 11-30
- https://doi.org/10.1016/s0747-7171(89)80003-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Worst-case optimal hidden-surface removalACM Transactions on Graphics, 1987
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Searching and storing similar listsJournal of Algorithms, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Finding extreme points in three dimensions and solving the post-office problem in the planeInformation Processing Letters, 1985
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975