Covering Minkowski sum boundary using points with applications

DOI10.1016/j.cagd.2008.06.006zbMath1172.65338OpenAlexW2129827919MaRDI QIDQ735518

Jyh-Ming Lien

Publication date: 22 October 2009

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2008.06.006

zbMATH Keywords

parallelizationmotion planninggeometric modelingMinkowski sum approximationpenetration depth estimationpoint-based representation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Artificial intelligence for robotics (68T40)

Related Items

Non-commutative morphology: Shapes, filters, and convolutions ⋮ Interactive generalized penetration depth computation for rigid and articulated models using object norm

Uses Software

• Qsplat
• OBBTree

Cites Work

• Unnamed Item
• Computing convolutions by reciprocal search
• From the zonotope construction to the Minkowski addition of convex polytopes
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Spatial Planning: A Configuration Space Approach
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
• Accurate Minkowski sum approximation of polyhedral models