Computing convolutions by reciprocal search

DOI10.1007/BF02187878zbMATH Open0623.68043MaRDI QIDQ1091816FDOQ1091816

Authors: Raimund Seidel, Leonidas Guibas 

Publication date: 1987

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

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

Recommendations

• Approximating large convolutions in digital images
• Time-space efficient algorithms for computing convolutions and related problems
• scientific article; zbMATH DE number 4037201
• Fast algorithms for the maximum convolution problem
• Space sweep solves intersection of convex polyhedra

zbMATH Keywords

computational geometryalgorithms for geometric convolution operationsconvex subdivisionspolygonal tracingspolyhedral tracingsreciprocal search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Filtering Search: A New Approach to Query-Answering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for Reporting and Counting Geometric Intersections
• Topologically sweeping an arrangement
• Plane-sweep algorithms for intersecting geometric figures
• Primitives for the manipulation of general subdivisions and the computation of Voronoi

Cited In (21)

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

This page was built for publication: Computing convolutions by reciprocal search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091816)