A computing strategy for applications involving offsets, sweeps, and Minkowski operations.
From MaRDI portal
Publication:1401751
DOI10.1016/S0010-4485(99)00014-7zbMATH Open1053.68743MaRDI QIDQ1401751FDOQ1401751
Authors: D. Massart
Publication date: 1999
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)
Cited In (8)
- Minkowski products of unit quaternion sets
- Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
- Offsetting operations in solid modelling
- The dual of sweep.
- A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums
- Offsetting in geometric modelling
- Exact Minkowski sums of polygons with holes
- Closed-form characterization of the Minkowski sum and difference of two ellipsoids
This page was built for publication: A computing strategy for applications involving offsets, sweeps, and Minkowski operations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401751)