Stabbing c-oriented polygons☆
References (14)
- et al.
On the intersection of orthogonal objects
Inform. Process. Lett.
(1981) - et al.
On the equivalence of some rectangle problems
Inform. Process. Lett.
(1982) Lines, curves and the characterization of curves
IFIP
(1980)New data structures for orthogonal queries
(1978)Solutions to Klee's rectangle problems
(1977)et al.The measure problem for rectangular ranges in d-space
J. of Algorithms
(1981)- et al.
Algorithms for reporting and counting geometric intersections
IEEE Trans. on Comput.
(1979) - et al.
An optimal worst-case algorithm for reporting intersections of rectangles
IEEE Trans. on Comput.
(1980)
There are more references available in the full text version of this article.
Cited by (21)
Fundamentals of restricted-orientation convexity
1996, Information SciencesDynamic output-sensitive hidden surface removal for c-oriented polyhedra
1992, Computational Geometry: Theory and ApplicationsHidden surface removal for c-oriented polyhedra
1992, Computational Geometry: Theory and ApplicationsThe intersection searching problem for c-oriented polygons
1991, Information Processing LettersOptimal computation of finitely oriented convex hulls
1987, Information and ComputationA fast algorithm for the Boolean masking problem
1985, Computer Vision, Graphics and Image Processing
- ☆
This work was carried out under a DAAD (Deutscher Akademischer Austauschdienst) Grant, while visiting Mc-Master University.
Copyright © 1983 Published by Elsevier B.V.