DOCSLIB.ORG

Geometrical Models and Algorithms for Irregular Shapes Placement Problems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Geometrical Models and Algorithms for Irregular Shapes Placement Problems !D 2014 GEOMETRICAL MODELS AND ALGORITHMS FOR IRREGULAR SHAPES PLACEMENT PROBLEMS PEDRO FILIPE MONTEIRO ROCHA TESE DE DOUTORAMENTO APRESENTADA À FACULDADE DE ENGENHARIA DA UNIVERSIDADE DO PORTO EM ENGENHARIA INFORMÁTICA FACULDADE DE ENGENHARIA DA UNIVERSIDADE DO PORTO Geometrical Models and Algorithms for Irregular Shapes Placement Problems Pedro Filipe Monteiro Rocha Doctoral Program in Informatics Engineering Supervisor: A. Miguel Gomes Co-Supervisor: Rui Rodrigues Julho de 2014 c Pedro Filipe Monteiro Rocha, 2014 Geometrical Models and Algorithms for Irregular Shapes Placement Problems Pedro Filipe Monteiro Rocha Doctoral Program in Informatics Engineering Julho de 2014 Abstract This thesis addresses the Irregular Piece Placement problem, also known as Nesting problem, while focusing on the resolution of real world instances with continuous rotations. The real world instances are considered very large instances containing many pieces with very complex outlines, where continuous rotations may be desired. The Nesting problem is presented, with a description of its characteristics, identifying the main challenges, and related problems. This is done through a literature review, considering the geometric representations and common solution approaches that are normally used, in order to identify possible paths to explore, and confirm its inherent difficulty in being efficiently tackled, specially when dealing with continuous rotations. The geometric component of the Nesting problems is addressed by using a novel algorithm that generates Circle Covering representations based on the Medial Axis skeleton of a piece. This iterative algorithm enables control over the approximation error, which allows managing the trade- off between the quality of circle covering representation and the total number of circles. This algorithm allows producing coverings with different levels of quality, and with different types of covering, depending on the characteristics of the Nesting problem where they will be used, which have a significant impact on the feasibility of the final solution and in the tightness of the layout. The solution approach is based on Non-Linear Programming models, from which several for- mulations were made, taking into account the size of the problem being addressed. These models fully support continuous rotations, and can produce feasible solutions with an acceptable com- putational cost. In order to tackle large instances, extensions to the NLP models are done, by aggregating constraints by type, and implementing other tweaks to reduce computational cost. In order to address issues with high computational cost, layout solutions with insufficient qual- ity, and very large instances, three approaches are proposed. The first uses a two-step compaction process, where the NLP model uses low resolution in the first step, and high resolution in the second. The second approach uses a two-phase compaction process, where in the first phase big pieces are compacted, considering certain parameters, and holes are created between the pieces, and in the second phase, the small pieces remaining are assigned and placed in the holes created in the first phase, and all compacted together. The last approach uses a multi-step approach, where pieces are separated in groups, and compacted into the layout in a sequential order, forming layers of pieces. These approaches show very promising results, being able to address the Nesting prob- lem with continuous rotations, considering their purpose. If these approaches are combined they can be used to improve results of currently existing approaches. i Resumo Esta tese aborda o problema de Posicionamento de Peças Irregulares, também conhecido como problema de Nesting, focado na resolução de instâncias reais destes problemas, considerando rotações contínuas. O problema de Nesting é apresentado com uma descrição das suas caracterís- ticas, identificando os desafios principais e problemas relacionados. Isto é feito através de uma revisão da literatura actual, considerando representações geométricas e métodos de resolução mais utilizados, com o objectivo de identificar possíveis oportunidades que possam ser exploradas de forma a abordar o problema de Nesting com rotações livres de forma mais eficiente. A componente geométrica do problema de Nesting é abordado com recurso a um novo algo- ritmo que cria uma representação baseada em cobertura por círculos, feita a partir de um esqueleto topológico de cada peça. Este algoritmo iterativo permite ter controlo sobre o erro de aproximação da peça, permitindo lidar com o compromisso entre a qualidade de representação e o número total de círculos produzido. Este algoritmo permite também produzir coberturas com níveis de qual- idade distintos, assim como tipos de cobertura de círculos diferentes, orientados para problemas específicos de Nesting, produzindo um impacto significativo na admissibilidade da solução final e na qualidade de compactação. O método de resolução utiliza modelos de programação não-linear, que foram obtidos através de diferentes formulações matemáticas do problema, tendo em conta o tamanho do problema a ser abordado. Estes modelos matemáticos suportam rotações livres, conseguindo produzir soluções admissíveis com um custo computacional razoável. De forma a poder lidar com instâncias de Nesting de grande tamanho, foram feitas extensões aos modelos matemáticos para reduzir o custo computacional, através da agregação de restrições. Para poder lidar com vários problemas relacionados com alto custo computacional, soluções com qualidade insuficiente e instâncias de tamanho muito grande, foram propostas três aborda- gens. A primeira utiliza um processo de compactação baseado em duas etapas, que utiliza res- olução baixa na primeira etapa, e uma resolução alta na segunda, de forma a compactar depressa, e ajustar as peças com qualidade. A segunda abordagem usa duas fases, compactando as peças grandes na primeira fase, criando buracos no espaço entre as peças grandes. Na segunda fase, as peças pequenas são atribuídas e colocadas nos buracos, sendo todas as peças compactadas de seguida. A terceira, e última abordagem utiliza várias etapas, separando inicialmente as peças em grupos distintos, e compactando-as numa ordem sequencial, formando camadas de peças, per- mitindo compactar grandes problemas, com custo computacional reduzido. Estas abordagens apresentam resultados muito promissores, conseguindo abordar problemas de Nesting com rotações contínuas, tendo em conta as suas vantagens individuais. Combinando estas abordagens, ou aplicando-as de uma forma específica, pode melhorar os resultados de abor- dagens existentes. iii Acknowledgements First an foremost, I would like to give thanks to Prof. António Miguel Gomes, my scientific supervisor, for his great support and encouragement during the duration of this Thesis. I also would like to thank all professors, colleagues and friends at the workplace, especially Prof. Franklina Toledo, Prof. Marina Andretta, and to my co-supervisor, Prof. Rui Rodrigues for their support. I must also thank everyone who gave their input on this Thesis and its contents. The final thanks will go to my family, and close friends, for their dedication and full support during the progression of this Thesis. Pedro Filipe Monteiro Rocha v Contents 1 Introduction 1 1.1 Research Questions . 2 1.2 Objectives and Contributions . 3 1.3 Thesis Outline . 4 2 The Problem of Nesting Irregular Shapes with Continuous Rotations 7 2.1 Nesting and Other Cutting and Packing Problems . 8 2.2 Geometrical Representations for the Nesting Problem . 13 2.2.1 Grid Representation . 14 2.2.2 Polygonal Representation . 16 2.2.3 Phi-Function Representation . 20 2.2.4 Circle Covering Representation . 22 2.3 Modeling the Nesting Problem . 27 2.3.1 Models derived from No-Fit-Polygon . 28 2.3.2 Models derived from Phi-Function . 31 2.3.3 Models derived from Circle Covering . 33 2.4 Solution Approaches to the Nesting Problem . 34 2.4.1 Mathematical Solvers . 35 2.4.2 Constructive Algorithms . 35 2.4.3 Improvement Algorithms . 40 2.5 Specific Geometric Algorithms for the Nesting Problem . 45 2.5.1 Spatial Partition Algorithms . 46 2.5.2 Collision Handling . 47 2.5.3 Convex Decomposition . 52 2.5.4 No-Fit-Polygon construction . 54 2.5.5 Medial Axis Construction . 60 2.6 Concluding Remarks . 64 3 Geometric Representation based on Circle Covering 69 3.1 Types of Circle Covering . 70 3.2 Hierarchical Circle Covering Approach . 70 3.3 Complete Circle Covering Approach . 72 3.3.1 Medial Axis Algorithm . 72 3.3.2 CCC-MA Algorithm . 73 3.3.3 Results and Discussion . 75 3.4 Partial and Inner Circle Covering Approaches . 78 3.4.1 kCC-MA Algorithm . 79 3.4.2 Coverings Simplifications . 81 vii viii CONTENTS 3.4.3 Tip Covering Correction . 82 3.4.4 Results and Discussion . 83 3.5 High and Low Resolution Coverings . 86 3.6 Concluding Remarks . 87 4 Non-Linear Programming Approach 91 4.1 Non-Linear Mathematical Model . 92 4.1.1 Model based on Circles . 92 4.1.2 Model based on Pieces . 94 4.2 Constraints Aggregation . 95 4.2.1 Aggregating Non-Overlapping Constraints . 96 4.2.2 Aggregating Containment Constraints . 97 4.2.3 Aggregating Piece Integrity Constraints . 98 4.2.4 Hierarchical Overlap Method . 99 4.2.5 Model Variants . 100 4.3 Layout Post-Optimization . 101 4.4 Results and Discussion . 103 4.4.1 Nesting Instances, Setup Configuration and Initial Solutions . 105 4.4.2 Testing the Model Variants . 107 4.4.3 Testing the High and Low Resolution Coverings . 111 4.4.4 Layout Post-Optimization Computational Experiments . 114 4.4.5 Testing the Circle Covering Types . 120 4.4.6 Non-Linear Programming Approach Evaluation . 122 4.5 Concluding Remarks . 126 5 Extended Non-Linear Approaches 131 5.1 Multi-Resolution Approach . 132 5.1.1 Multi-Resolution Algorithm . 132 5.1.2 Results and Discussion . 133 5.2 Two-Phase Approach . 135 5.2.1 Two-Phase Approach Overall Description . 137 5.2.2 Non-Linear Programming Model Extension for the First Phase . 140 5.2.3 Second Phase Hole Fill and Layout Compaction . 143 5.2.4 Results and Discussion . 145 5.3 Tweaking Normal Optimization for Layout Feasibility in Post-Optimization .
Load more

Recommended publications
  • Winding Numbers and Solid Angles
    Palestine Polytechnic University Deanship of Graduate Studies and Scientific Research Master Program of Mathematics Winding Numbers and Solid Angles Prepared by Warda Farajallah M.Sc. Thesis Hebron - Palestine 2017 Winding Numbers and Solid Angles Prepared by Warda Farajallah Supervisor Dr. Ahmed Khamayseh M.Sc. Thesis Hebron - Palestine Submitted to the Department of Mathematics at Palestine Polytechnic University as a partial fulfilment of the requirement for the degree of Master of Science. Winding Numbers and Solid Angles Prepared by Warda Farajallah Supervisor Dr. Ahmed Khamayseh Master thesis submitted an accepted, Date September, 2017. The name and signature of the examining committee members Dr. Ahmed Khamayseh Head of committee signature Dr. Yousef Zahaykah External Examiner signature Dr. Nureddin Rabie Internal Examiner signature Palestine Polytechnic University Declaration I declare that the master thesis entitled "Winding Numbers and Solid Angles " is my own work, and hereby certify that unless stated, all work contained within this thesis is my own independent research and has not been submitted for the award of any other degree at any institution, except where due acknowledgment is made in the text. Warda Farajallah Signature: Date: iv Statement of Permission to Use In presenting this thesis in partial fulfillment of the requirements for the master degree in mathematics at Palestine Polytechnic University, I agree that the library shall make it available to borrowers under rules of library. Brief quotations from this thesis are allowable without special permission, provided that accurate acknowledg- ment of the source is made. Permission for the extensive quotation from, reproduction, or publication of this thesis may be granted by my main supervisor, or in his absence, by the Dean of Graduate Studies and Scientific Research when, in the opinion either, the proposed use of the material is scholarly purpose.
    [Show full text]
  • Understanding the Polygon with the Eyes of Blinds*
    International Journal of Progressive Education, Volume 15 Number 1, 2019 © 2019 INASED Understanding the Polygon with the Eyes of Blinds* Tuğba Horzum i Necmettin Erbakan University Ahmet Arıkan ii Gazi University Abstract This study investigated the concept images of blind students about the polygon concept. For this purpose, four open-ended questions were asked to five blind middle school students. During the interviews, geometric shapes were presented with raised-line materials and blind students were given opportunities to construct geometric shapes with magnetic sticks and micro-balls. Qualitative research techniques applied in grounded theory were used for analyzing documents pictures, which were taken from magnetic geometric shapes that blind students constructed, raised-line materials and researchers’ observation notes and interviews. As a result, it is determined that blind students have more than one concept image for the polygon concept. They scrutinized the polygon concept analytically not with a holistic perspective. They were often conflicted about triangle, rectangle, square, circle and circular region whether or not being a polygon. They also encountered with the difficulties associated with the combination of polygon sides’ endpoints consecutively. Keywords: blind students, concept definition, concept image, polygon, geometry education DOI: 10.29329/ijpe.2019.184.8 *This study is a part of the first author’s doctoral thesis and A brief version of this study has been presented at the ICEST 2015: 17th International Conference on Educational Sciences and Technology, Rome, Italy. ------------------------------- i Tuğba Horzum, Assist. Prof. Dr., Necmettin Erbakan University, Department of Mathematics and Science Education, Konya, Turkey. Correspondence: [email protected] ii Ahmet Arıkan, Prof.
    [Show full text]
  • A Simple and Correct Even-Odd Algorithm for the Point-In-Polygon Problem for Complex Polygons
    A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons Michael Galetzka1 and Patrick Glauner2 1Disy Informationssysteme GmbH, Ludwig-Erhard-Allee 6, 76131 Karlsruhe, Germany 2Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, 4 rue Alphonse Weicker, 2721 Luxembourg, Luxembourg Keywords: Complex Polygon, Even-Odd Algorithm, Point-in-Polygon. Abstract: Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds true in particular for complex polygons whose edges intersect each other creating holes. In this paper we present a simple even-odd algorithm to solve this problem for complex polygons in linear time and prove its correctness for all possible points and polygons. We furthermore provide examples and implementation notes for this algorithm. 1 INTRODUCTION A lot of special cases have to be considered (e.g. if the point lies on an edge) and most of the exist- At a first glance, the point-in-polygon problem seems ing even-odd algorithms either fail one or more of to be a rather simple problem of geometry: given an these special cases or have to implement some kind arbitrary point Q and a closed polygon P, the question of workaround (Schirra, 2008). The rest of this paper is whether the point lies inside or outside the poly- is organized as follows. In Section 2, we present an gon. There exist different algorithms to solve this even-odd algorithm and prove its correctness for all problem, such as a cell-based algorithm (Zalik and possible points and polygons with no special cases to Kolingerova), the winding number algorithm (Hor- be considered.
    [Show full text]
  • No Fit Polygon Problem JONAS LINDMARK
    No Fit Polygon problem Developing a complete solution to the No Fit Polygon problem JONAS LINDMARK Thesis at CSC Supervisor at Tomologic: Jim Wilenius Supervisor at KTH: Johan Håstad Examiner: Johan Håstad February 20, 2013 Abstract This thesis evaluates some of the most recent and promising approaches for deriving the No Fit Polygon for two simple polygons, possibly with holes, and verify that the approach works in practice. We have chosen three dif- ferent approaches based on the complexity of the input. These approaches were implemented and benchmarked against CGAL [1], a third party library which provides solvers for many computational geometry problems. Our solution solves problems of a higher degree of complexity than that of the library we benchmarked against and for input of lower complexity we solve the problem in a more efficient manner. Utvecklande av en komplett lösning av No Fit Polygon - problemet Den här uppsatsen evaluerar några av de senaste och mest lovande tillvä- gagånssätt för att generera No Fit - polygonen för två enkla polygoner, med och utan hål, och verifiera att de fungerar i praktiken. Vi har valt tre olika tillvägagångssätt baserat på komplexiteten av indata. Dessa tillvägagångs- sätt implementerades och jämfördes med CGAL [1], ett tredjepartsbibliotek som tillhandahåller lösare av många beräkningsgeometriska problem. Vår lösning klarar problem av en högre grad av komplexitet än tredje- partsbiblioteket vi jämför med. För indata av lägre komplexitetsnivåer löser vi problemet mer effektivt. Contents 1 Introduction 1 1.1 Introduction . .1 1.2 Goal of the thesis . .3 2 Background 5 2.1 Mathematical background . .5 2.1.1 Reference vertex .
    [Show full text]
  • Proposed Algorithm
    An Extension Of Weiler-Atherton Algorithm To Cope With The 1 Self-intersecting Polygon ABSTRACT: In this paper a new algorithm has been proposed which can fix the problem of Weiler- Atherton algorithm. The problem of Weiler-Atherton algorithm lies in clipping self-intersecting polygon. Clipping self-intersecting polygon is not considered in Weiler-Atherton algorithm and hence it is also a main disadvantage of this algorithm. In our new algorithm a self-intersecting polygon has been divided into non- self-intersecting contours and then perform the Weiler-Atherton clipping algorithm on those sub polygons. For holes we have to store the edges that is not hole contour’s own boundary from recently clipped polygon. Thus if both contour is hole then we have to store all the edges of the recently clipped polygon. Finally the resultant polygon has been produced by eliminating all the stored edges. INTRODUCTION : Clipping 2D polygons is one of the important task in the computer graphics. In case of 3D polygon rendering this task has to be done several times. In modern applications more general and complex polygon has to be clipped. But only a few algorithms too general to clip such polygon. Sutherland and Hodgeman’s algorithm[2] is limited to convex clip polygons. The algorithm presented in [6] i.e Liang- Barsky are able to clip polygon but the problem lies on the clipper polygon’s limitation i.e clipper polygon must have to be rectangle. More general algorithms were presented in [ 8, 9, 10,11]. They allow concave polygons with holes, but they do not permit self-intersections.
    [Show full text]
  • New Framework for Decomposing a Polygon with Zero Or More Holes
    Send Orders for Reprints to [email protected] 390 The Open Cybernetics & Systemics Journal, 2015, 9, 390-405 Open Access New Framework for Decomposing a Polygon with Zero or More Holes Zhou Hongguang* and Wang Guozhao Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang, 310027, P.R. China Abstract: In this paper, we propose a unified framework for decomposition of a polygon with or without holes, enlight- ened by approximate convex decomposition. We transform target polygon containing holes into the polygon without holes by merging holes into external boundary, thus only need to partition the polygon without holes. Several constraints are en- forced to ensure generate more visually meaningful decompositions, more elegant final components than that of other methods. Moreover, we estimate tolerance from geometry information of target polygon to obtain a naturally visual de- composition, a polished hierarchical representation. Our approach computes a decomposition of a polygon, containing ze- ro or more holes, with n vertices and r notches in O(nr) time. In contrast, exact convex decomposition is NP-hard, or if the polygon has no holes, takes much more time. Many experimental results and applications are presented to show the supe- riority, applicability and flexibility of our approach. Keywords: approximate convex decomposition, constraints, hierarchical representation, holes, naturally visual decomposition, Polygon, tolerance , 1. INTRODUCTION significant concave features, finally to obtain approximately convex pieces. The decomposing results using ACD are both Shape is the essence of many geometric problems. Many significantly smaller and can be computed more efficiently geometric problems have simpler and faster solutions on due to ACD provides a mechanism to focus on key features, such a restricted type of polygon, so the strategy of solving and ignore less significant features.
    [Show full text]
  • Polygon from Wikipedia, the Free Encyclopedia for Other Uses, See Polygon (Disambiguation)
    Polygon From Wikipedia, the free encyclopedia For other uses, see Polygon (disambiguation). In elementary geometry, a polygon /ˈpɒlɪɡɒn/ is a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain or circuit. These segments are called its edges or sides, and the points where two edges meet are the polygon's vertices (singular: vertex) or corners. The interior of the polygon is sometimes called its body. An n-gon is a polygon with n sides. A polygon is a 2-dimensional example of the more general polytope in any number of dimensions. Some polygons of different kinds: open (excluding its The basic geometrical notion of a polygon has been adapted in various ways to suit particular purposes. boundary), bounding circuit only (ignoring its interior), Mathematicians are often concerned only with the bounding closed polygonal chain and with simple closed (both), and self-intersecting with varying polygons which do not self-intersect, and they often define a polygon accordingly. A polygonal boundary may densities of different regions. be allowed to intersect itself, creating star polygons. Geometrically two edges meeting at a corner are required to form an angle that is not straight (180°); otherwise, the line segments may be considered parts of a single edge; however mathematically, such corners may sometimes be allowed. These and other generalizations of polygons are described below. Contents 1 Etymology 2 Classification 2.1 Number of sides 2.2 Convexity and non-convexity 2.3 Equality
    [Show full text]
  • Sharp Feature Identification in a Polygon
    UNLV Theses, Dissertations, Professional Papers, and Capstones 5-2011 Sharp feature identification in a polygon Joseph P. Scanlan University of Nevada, Las Vegas Follow this and additional works at: https://digitalscholarship.unlv.edu/thesesdissertations Part of the Geometry and Topology Commons, and the Theory and Algorithms Commons Repository Citation Scanlan, Joseph P., "Sharp feature identification in a polygon" (2011). UNLV Theses, Dissertations, Professional Papers, and Capstones. 965. http://dx.doi.org/10.34917/2308309 This Thesis is protected by copyright and/or related rights. It has been brought to you by Digital Scholarship@UNLV with permission from the rights-holder(s). You are free to use this Thesis in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/ or on the work itself. This Thesis has been accepted for inclusion in UNLV Theses, Dissertations, Professional Papers, and Capstones by an authorized administrator of Digital Scholarship@UNLV. For more information, please contact [email protected]. SHARP FEATURE IDENTIFICATION IN A POLYGON by Joseph P. Scanlan Bachelor of Science University of Nevada, Las Vegas 1983 A thesis submitted in partial fulfillment of the requirement for the Master of Science in Computer Science School of Computer Science Howard R. Hughes College of Engineering Graduate College University of Nevada, Las Vegas May 2011 Copyright by Joseph P. Scanlan 2011 All Rights Reserved THE GRADUATE COLLEGE We recommend the thesis prepared under our supervision by Joseph P.
    [Show full text]