Covering Minkowski sum boundary using points with applications

DOI10.1016/J.CAGD.2008.06.006MaRDI QIDQ735518zbMATHOpenAlexFDO

Authors 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

motion planningparallelizationgeometric modelingMinkowski sum approximationpenetration depth estimationpoint-based representation

Mathematics Subject Classification ID

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

Recommendations

• A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
• Minkowski sums of point sets defined by inequalities
• Accurate Minkowski sum approximation of polyhedral models
• Improvements to algorithms for computing the Minkowski sum of 3-polytopes
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions

Cites work

• scientific article; zbMATH DE number 1501060 (Why is no real title available?)
• Accurate Minkowski sum approximation of polyhedral models
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Computing convolutions by reciprocal search
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• From the zonotope construction to the Minkowski addition of convex polytopes
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Spatial Planning: A Configuration Space Approach

Cited in

(5)

• Approximate unions of lines and Minkowski sums
• Non-commutative morphology: Shapes, filters, and convolutions
• Minkowski sums of point sets defined by inequalities
• Algorithms – ESA 2004
• Interactive generalized penetration depth computation for rigid and articulated models using object norm

Describes a project that uses

Uses Software

• Qsplat
• OBBTree

This page was built for publication: Covering Minkowski sum boundary using points with applications

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