Robust approximate assembly partitioning

Elisha Sacks, Victor Milenkovic, Yujun Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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)
Title of host publicationProceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
StatePublished - 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

Fingerprint

Partitioning
Great circle
Minkowski Sum
Robust Algorithm
Computational Geometry
Polyhedron
Computational geometry
Arrangement
Arc of a curve
Robustness
Perturbation
Strategy

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Cite this

Sacks, E., Milenkovic, V., & Wu, Y. (2011). Robust approximate assembly partitioning. In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

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 proceedingConference contribution

Sacks, E, Milenkovic, V & Wu, Y 2011, Robust approximate assembly partitioning. in Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, Toronto, ON, Canada, 8/10/11.
Sacks E, Milenkovic V, Wu Y. Robust approximate assembly partitioning. In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011
Sacks, Elisha ; Milenkovic, Victor ; Wu, Yujun. / Robust approximate assembly partitioning. Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011.
@inproceedings{cdd17127728044dcb82c93ba559ec008,
title = "Robust approximate assembly partitioning",
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.",
author = "Elisha Sacks and Victor Milenkovic and Yujun Wu",
year = "2011",
language = "English (US)",
booktitle = "Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011",

}

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

BT - Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

ER -