Covering Minkowski sum boundary using points with applications
type: Item
instance of: scholarly article
title: Covering Minkowski sum boundary using points with applications
zbMATH Open document ID: 1172.65338
author: Jyh-Ming Lien
published in: Computer Aided Geometric Design
publication date: 2009-10-22T00:00:00Z
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68T40
zbMATH DE Number: 5619672
zbMATH Keywords: point-based representation
zbMATH Keywords: Minkowski sum approximation
zbMATH Keywords: parallelization
zbMATH Keywords: geometric modeling
zbMATH Keywords: motion planning
zbMATH Keywords: penetration depth estimation
describes a project that uses: OBBTree
describes a project that uses: Qsplat
MaRDI profile type: Publication
full work available at URL: j.cagd.2008.06.006
OpenAlex ID: W2129827919
cites work: Q4499941
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
cites work: From the zonotope construction to the Minkowski addition of convex polytopes
cites work: Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
cites work: Computing convolutions by reciprocal search
cites work: Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
cites work: Spatial Planning: A Configuration Space Approach
cites work: Accurate Minkowski sum approximation of polyhedral models
DOI: 10.1016/J.CAGD.2008.06.006
description: scientific article; zbMATH DE number 5619672