Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time
- 30 September 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 8 (4) , 181-193
- https://doi.org/10.1016/s0925-7721(96)00009-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An algorithm for generalized point location and its applicationsJournal of Symbolic Computation, 1990
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- The shortest watchtower and related problems for polyhedral terrainsInformation Processing Letters, 1988
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Searching and storing similar listsJournal of Algorithms, 1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983