Robust approximate assembly partitioning

Elisha Sacks; Victor Milenkovic; Yujun Wu

Robust approximate assembly partitioning

Elisha Sacks, Victor Milenkovic, Yujun Wu

Computer Science

Research output: Contribution to conference › Paper › peer-review

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 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/Territory	Canada
City	Toronto, ON
Period	8/10/11 → 8/12/11

ASJC Scopus subject areas

Computational Mathematics
Geometry and Topology

Cite this

@conference{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",

month = dec,

day = "1",

language = "English (US)",

note = "23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 ; Conference date: 10-08-2011 Through 12-08-2011",

}

TY - CONF

T1 - Robust approximate assembly partitioning

AU - Sacks, Elisha

AU - Milenkovic, Victor

AU - Wu, Yujun

PY - 2011/12/1

Y1 - 2011/12/1

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 - Paper

AN - SCOPUS:84882943574

T2 - 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Y2 - 10 August 2011 through 12 August 2011

ER -

Robust approximate assembly partitioning

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this