Visibility with a moving point of view
- 1 April 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 11 (4) , 360-378
- https://doi.org/10.1007/bf01187019
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Making data structures persistentJournal of Computer and System Sciences, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Frame-to-frame coherence and the hidden surface computationACM SIGGRAPH Computer Graphics, 1981
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979