Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New algorithms for special cases of the hidden line elimination problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Dynamization of geometric data structures
SCG '85 Proceedings of the first annual symposium on Computational geometry
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ACM SIGACT News
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An efficient algorithm for hidden surface removal, II
Proceedings of the 30th IEEE symposium on Foundations of computer science
An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
A simple but important special case of the hidden surface removal problem is one in which the scene consists of n rectangles with sides parallel to the x and y-axes, with viewpoint at z = ∞ (that is, an orthographic projection). This special case has application to overlapping windows. An algorithm with running time &Ogr;(n log n log log n + k log n) is given for static scenes, where k is the number of line segments in the output. Algorithms are given for a dynamic setting (that is, rectangles may be inserted and deleted) that take time &Ogr;(log2 n log log n + k log2 n) per insert or delete, where k is now the number of visible line segments that change (appear or disappear). Algorithms for point location in the visible scene are also given.