Back to Results
First PageMeta Content
Analysis of algorithms / Computational complexity theory / Convex geometry / Digital geometry / Minkowski addition / Algorithm / Time complexity / Mathematics / Theoretical computer science / Geometry


CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic†
Add to Reading List

Document Date: 2011-08-06 04:11:12


Open Document

File Size: 444,46 KB

Share Result on Facebook

City

Boca Raton / /

Company

Intel / CRC Press / /

Currency

pence / /

/

Facility

University of Miami / Purdue University / /

IndustryTerm

sign assignment algorithm / complicated 3D algorithms / scientific computing community / arrangement algorithm / geometric algorithms / sweep algorithm / binary search / prior algorithm / later algorithm / clearance solutions / approximate solution / approximate assembly partitioning algorithm / plane sweep algorithm / prior robust algorithm / assembly partitioning algorithm / convolution algorithm / manufacturing variation / 3D algorithms / /

Organization

National Science Foundation / Department of Computer Science / U.S. Securities and Exchange Commission / University of Miami / Purdue University / /

Person

Victor Milenkovic† Yujun Wu / Elisha Sacks∗ Victor Milenkovic / G. Hanrot / V / /

Position

general strategy / advocate an alternate robustness strategy / /

ProvinceOrState

Florida / /

PublishedMedium

ACM Transactions on Graphics / /

Technology

sign assignment algorithm / 3 Arrangement algorithm / sweep algorithm / real RAM algorithm / Correctness CLP algorithms / prior algorithm / plane sweep algorithm / 3D algorithms / CLP algorithm / Arrangement algorithm / complicated 3D algorithms / P3 The assembly partitioning algorithm / convolution algorithm / assembly partitioning algorithm / Simulation / approximate assembly partitioning algorithm / later algorithm / /

URL

http /

SocialTag