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) |
|---|---|
| Title of host publication | Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 |
| State | Published - 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 |
Fingerprint
ASJC Scopus subject areas
- Computational Mathematics
- Geometry and Topology
Cite this
Robust approximate assembly partitioning. / Sacks, Elisha; Milenkovic, Victor; Wu, Yujun.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Robust approximate assembly partitioning
AU - Sacks, Elisha
AU - Milenkovic, Victor
AU - Wu, Yujun
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84882943574&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84882943574&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84882943574
BT - Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
ER -