Polygon decomposition for efficient construction of Minkowski sums
- 31 January 2002
- journal article
- conference paper
- Published by Elsevier in Computational Geometry
- Vol. 21 (1-2), 39-61
- https://doi.org/10.1016/s0925-7721(01)00041-4
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONSInternational Journal of Computational Geometry & Applications, 2002
- A General Framework for Assembly Planning: The Motion Space ApproachAlgorithmica, 2000
- Polygon DecompositionPublished by Elsevier ,2000
- Offsets, sweeps, and Minkowski sumsComputer-Aided Design, 1999
- Polynomial/Rational Approximation of Minkowski Sum Boundary CurvesGraphical Models and Image Processing, 1998
- Davenport–Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal)SIAM Review, 1996
- COMPUTING MINKOWSKI SUMS OF PLANE CURVESInternational Journal of Computational Geometry & Applications, 1995
- Approximating the minimum weight steiner triangulationDiscrete & Computational Geometry, 1994
- Generation of configuration space obstacles: The case of moving algebraic curvesAlgorithmica, 1989
- Decomposing a Polygon into Simpler ComponentsSIAM Journal on Computing, 1985