A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS

DOI10.1142/S0218195907002392zbMATH Open1141.65348OpenAlexW2115744154MaRDI QIDQ5386747FDOQ5386747

Authors: Victor J. Milenkovic, Elisha Sacks 

Publication date: 14 May 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195907002392

Recommendations

• Two approximate Minkowski sum algorithms
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
• Minkowski sums of rotating convex polyhedra
• Minkowski sums of monotone and general simple polygons

zbMATH Keywords

computational geometryMinkowski sumkinetic algorithmmonotonic convolutionkinetic framework

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Computing convolutions by reciprocal search

Cited In (5)

• Traveling the boundary of Minkowski sums.
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
• Minkowski sums of monotone and general simple polygons
• Two approximate Minkowski sum algorithms
• Title not available (Why is that?)

This page was built for publication: A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS

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