Efficient algorithms for common transversals
Information Processing Letters
Algorithms for line transversals in space
SCG '87 Proceedings of the third annual symposium on Computational geometry
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Stabbing and ray shooting in 3 dimensional space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Finding stabbing lines in 3-dimensional space
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Sets of lines and cutting out polyhedral objects
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Computing terrain multi-visibility maps for a set of view segments using graphics hardware
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.00 |
A new geometrical transform, skewed-projection, is introduced. This transform is applied to design a new algorithm for a common transversal problem for families of polyhedra in R3. The time and space analysis, using Davenport-Schinzel sequences, is given.