• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 34 (2015)
    • 34-Issue 8
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 34 (2015)
    • 34-Issue 8
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Shapes In a Box: Disassembling 3D Objects for Efficient Packing and Fabrication

    Thumbnail
    View/Open
    v34i8pp064-076.pdf (767.7Kb)
    Date
    2015
    Author
    Attene, Marco
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Modern 3D printing technologies and the upcoming mass‐customization paradigm call for efficient methods to produce and distribute arbitrarily shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that can be efficiently packed within a box, with the objective of reassembling them after delivery. The first step consists in the creation of a hierarchy of possible parts that can be tightly packed within their minimum bounding boxes. In a second step, the hierarchy is exploited to extract the (single) segmentation whose parts can be most tightly packed. The fact that shape packing is an NP‐complete problem justifies the use of heuristics and approximated solutions whose efficacy and efficiency must be assessed. Extensive experimentation demonstrates that our algorithm produces satisfactory results for arbitrarily shaped objects while being comparable to methods when specific shapes are considered.Modern 3D printing technologies and the upcoming mass‐customization paradigm call for efficient methods to produce and distribute arbitrarily shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that can be efficiently packed within a box, with the objective of reassembling them after delivery. The first step consists in the creation of a hierarchy of possible parts that can be tightly packed within their minimum bounding boxes. In a second step, the hierarchy is exploited to extract the (single) segmentation whose parts can be most tightly packed. The fact that shape packing is an NP‐complete problem justifies the use of heuristics and approximated solutions whose efficacy and efficiency must be assessed.
    BibTeX
    @article {10.1111:cgf.12608,
    journal = {Computer Graphics Forum},
    title = {{Shapes In a Box: Disassembling 3D Objects for Efficient Packing and Fabrication}},
    author = {Attene, Marco},
    year = {2015},
    publisher = {Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd.},
    DOI = {10.1111/cgf.12608}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12608
    Collections
    • 34-Issue 8

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA