A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums
From MaRDI portal
Publication:2154245
Recommendations
- COMPUTING MINKOWSKI SUMS OF PLANE CURVES
- SWEPT VOLUMES: FUNDATION, PERSPECTIVES, AND APPLICATIONS
- A computing strategy for applications involving offsets, sweeps, and Minkowski operations.
- ON COMPUTING TRANSLATIONAL SWEPT VOLUMES
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Cites work
- COMPUTING MINKOWSKI SUMS OF PLANE CURVES
- Computing convolutions and Minkowski sums via support functions
- Generation of configuration space obstacles: The case of moving algebraic curves
- Geometric modeling with splines: an introduction
- Local and global analysis of parametric solid sweeps
- Subdivision methods for solving polynomial equations
- Sweeping of three-dimensional objects
- Tracing surface intersections
- Trimming swept volumes.
This page was built for publication: A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154245)