IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i1p351-361.html
   My bibliography  Save this article

Sparse layout of irregular 3D clusters

Author

Listed:
  • Tatiana Romanova
  • Alexander Pankratov
  • Igor Litvinchev
  • Vladimir Dubinskyi
  • Luis Infante

Abstract

A sparse layout problem for clusters formed by irregular 3D objects is introduced. The shape of a 3D cluster is represented as a convex hull of the objects inside the cluster. The objects in the cluster may have different irregular shapes, can be freely translated and rotated and must be placed in the cluster without mutual overlapping. Each irregular 3D object in the cluster is composed by a union of basic convex 3D objects. The clusters must be placed in a container without mutual overlapping. The objective is to maximize the distance between the 3D clusters. New geometric tools to describe analytically nonoverlapping, containment and distance constraints for 3D clusters are introduced. The sparse layout problem is formulated as a nonlinear nonconvex continuous programming problem. A solution algorithm is proposed, and computational results are provided.

Suggested Citation

  • Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Vladimir Dubinskyi & Luis Infante, 2023. "Sparse layout of irregular 3D clusters," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(1), pages 351-361, January.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:1:p:351-361
    DOI: 10.1080/01605682.2022.2039568
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2039568
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2039568?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:74:y:2023:i:1:p:351-361. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.