Robust approximate assembly partitioning

Elisha Sacks, Victor Milenkovic, Yujun Wu

Research output: Contribution to conferencePaper

1 Scopus citations

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 languageEnglish (US)
StatePublished - Dec 1 2011
Event23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 - Toronto, ON, Canada
Duration: Aug 10 2011Aug 12 2011

Other

Other23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
CountryCanada
CityToronto, ON
Period8/10/118/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.