TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS

DOI10.1142/S0218195910003402zbMath1202.65029OpenAlexW2116476963MaRDI QIDQ4931734

Victor J. Milenkovic, Elisha P. Sacks

Publication date: 30 September 2010

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

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

zbMATH Keywords

Minkowski sumrobust computational geometrykinetic framework

Mathematics Subject Classification ID

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

Related Items (6)

Quasi-phi-functions and optimal packing of ellipses ⋮ Efficient Predicate Evaluation Using Randomized Degeneracy Detection ⋮ PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Optimal clustering of a pair of irregular objects ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications

Cites Work

• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Vertex-rounding a three-dimensional polyhedral subdivision
• Iterated snap rounding
• Shortest path geometric rounding
• A floating-point technique for extending the available precision
• A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS

This page was built for publication: TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS