Abstract
We present a robust approximate assembly partitioning algorithm for polyhedral parts. We achieve robustness by applying our controlled linear perturbation strategy to Minkowski sums of polyhedra and to arrangements of great circle arcs. Our algorithm is far faster than a prior robust algorithm based on exact computational geometry. Its error is small even on degenerate input.
| Original language | English (US) |
|---|---|
| State | Published - Dec 1 2011 |
| Event | 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 - Toronto, ON, Canada Duration: Aug 10 2011 → Aug 12 2011 |
Other
| Other | 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 |
|---|---|
| Country | Canada |
| City | Toronto, ON |
| Period | 8/10/11 → 8/12/11 |
ASJC Scopus subject areas
- Computational Mathematics
- Geometry and Topology
Fingerprint Dive into the research topics of 'Robust approximate assembly partitioning'. Together they form a unique fingerprint.
Cite this
Sacks, E., Milenkovic, V., & Wu, Y. (2011). Robust approximate assembly partitioning. Paper presented at 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, Toronto, ON, Canada.