Covering Minkowski sum boundary using points with applications
- 30 November 2008
- journal article
- Published by Elsevier BV in Computer Aided Geometric Design
- Vol. 25 (8), 652-666
- https://doi.org/10.1016/j.cagd.2008.06.006
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex PiecesLecture Notes in Computer Science, 2007
- Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with ApplicationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- From the zonotope construction to the Minkowski addition of convex polytopesJournal of Symbolic Computation, 2004
- Computing and rendering point set surfacesIEEE Transactions on Visualization and Computer Graphics, 2003
- An optimal algorithm for approximate nearest neighbor searching in fixed dimensionsJournal of the ACM, 1998
- A Random Sampling Scheme for Path PlanningThe International Journal of Robotics Research, 1997
- OBBTreePublished by Association for Computing Machinery (ACM) ,1996
- A unified computational framework for Minkowski operationsComputers & Graphics, 1993
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner BasesSIAM Journal on Discrete Mathematics, 1993
- Computing convolutions by reciprocal searchDiscrete & Computational Geometry, 1987