Computing convolutions by reciprocal search

DOI10.1007/BF02187878zbMath0623.68043MaRDI QIDQ1091816

Raimund Seidel, Leonidas J. Guibas

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131017

zbMATH Keywords

computational geometryalgorithms for geometric convolution operationsconvex subdivisionspolygonal tracingspolyhedral tracingsreciprocal search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

2-point site Voronoi diagrams, An efficient algorithm for hidden surface removal. II, On determining optimal strategies in pursuit games in the plane, Generation of configuration space obstacles: The case of moving algebraic curves, Bipartite diameter and other measures under translation, All convex polyhedra can be clamped with parallel jaw grippers, Computing constrained minimum-width annuli of point sets, The upper envelope of piecewise linear functions: Algorithms and applications, A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS, OVERLAYING SURFACE MESHES, PART I: ALGORITHMS, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Mathematical morphological operations of boundary-represented geometric objects., Unnamed Item, Covering Minkowski sum boundary using points with applications, On determining optimal strategies in pursuit games in the plane, Storing the subdivision of a polyhedral surface, Traveling the boundary of Minkowski sums., Algorithms for bichromatic line-segment problems and polyhedral terrains, Translating a convex polyhedron over monotone polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Topologically sweeping an arrangement
• Algorithms for Reporting and Counting Geometric Intersections
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Filtering Search: A New Approach to Query-Answering
• Plane-sweep algorithms for intersecting geometric figures