Covering Minkowski sum boundary using points with applications

DOI10.1016/j.cagd.2008.06.006zbMath1172.65338MaRDI 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

parallelization; motion planning; geometric modeling; Minkowski sum approximation; penetration depth estimation; point-based representation

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

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

68T40: Artificial intelligence for robotics

Related Items

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

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