Abstract
In this paper we show how certain geometric convolution operations can be computed efficiently. Here “efficiently” means that our algorithms have running time proportional to the input size plus the output size. Our convolution algorithms rely on new optimal solutions for certain reciprocal search problems, such as finding intersections between “blue” and “green” intervals, and overlaying convex planar subdivisions.
Article PDF
Similar content being viewed by others
References
J. L. Bentley and T. A. Ottmann, Algorithm for reporting and counting gometric intersections,IEEE Trans. Comput. 28 (1979), 643–647.
B. Chazelle, Filtering search: a new approach to query-answering,SIAM J. Comput. 15 (1986), 703–724.
H. Edelsbrunner and L. J. Guibas, Topologically sweeping an arrangement,Proceedings of the 18th ACM Symposium on Theory of Computing, 389–403, 1986.
N. Grünbaum,Convex Polytopes, Interscience, New York, 1967.
L. J. Guibas, L. Ramshaw, and J. Stolfi, A kinetic framework for computational geometry,Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 100–111, 1983.
L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 74–123.
J. Nievergelt and F. P. Preparata, Plane-sweep algorithms for intersecting geometric figures,Comm. ACM 25 (1982), 739–747.
E. H. Spanier,Algebraic Topology, Springer-Verlag, New York, 1966.
Author information
Authors and Affiliations
Additional information
Communicated by David Dobkin
This research was done while on leave from Cornell at DEC/SRC.
Rights and permissions
About this article
Cite this article
Guibas, L.J., Seidel, R. Computing convolutions by reciprocal search. Discrete Comput Geom 2, 175–193 (1987). https://doi.org/10.1007/BF02187878
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187878