2018-09-28
AUTHORSGeorgi Evtimov , Stefka Fidanova
ABSTRACTThe 2D cutting stock problem (CSP) arises in many industries as paper industry, glass industry, biding construction and so on. In paper and glass industries the cutting shapes are rectangles. In building constructions industry the cutting shapes are postilions, which can have irregular form and can be convex and concave. This increases the difficulty of the problem. In our work we concentrated on 2D cutting stock problem, coming from building industry. Many manufactures companies, which build steel structures, have to cut plates and profiles. The CSP is well known like NP-hard combinatorial optimization problem. The plates are represented like 2D polygons in any CAD environment. The aim of this issue is to apply some mathematical algorithms on each polygon and to prepare them for subsequent processing for solving the main problem. This task is the following basic step (preprocessor) for solving a 2D CSP - arrange all given plates from the project in minimum area. Our preprocessing includes the following main steps: Is polygon clock wise; Remove Wasted Points; Find Intersection Points; Represent the two polygons subtraction by Boolean table. More... »
PAGES107-118
Advanced Computing in Industrial Mathematics
ISBN
978-3-319-97276-3
978-3-319-97277-0
http://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_9
DOIhttp://dx.doi.org/10.1007/978-3-319-97277-0_9
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1107272558
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/09",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Engineering",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0905",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Civil Engineering",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria",
"id": "http://www.grid.ac/institutes/grid.410344.6",
"name": [
"Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria"
],
"type": "Organization"
},
"familyName": "Evtimov",
"givenName": "Georgi",
"id": "sg:person.07366160356.00",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07366160356.00"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria",
"id": "http://www.grid.ac/institutes/grid.410344.6",
"name": [
"Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria"
],
"type": "Organization"
},
"familyName": "Fidanova",
"givenName": "Stefka",
"id": "sg:person.011173106320.18",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011173106320.18"
],
"type": "Person"
}
],
"datePublished": "2018-09-28",
"datePublishedReg": "2018-09-28",
"description": "The 2D cutting stock problem (CSP) arises in many industries as paper industry, glass industry, biding construction and so on. In paper and glass industries the cutting shapes are rectangles. In building constructions industry the cutting shapes are postilions, which can have irregular form and can be convex and concave. This increases the difficulty of the problem. In our work we concentrated on 2D cutting stock problem, coming from building industry. Many manufactures companies, which build steel structures, have to cut plates and profiles. The CSP is well known like NP-hard combinatorial optimization problem. The plates are represented like 2D polygons in any CAD environment. The aim of this issue is to apply some mathematical algorithms on each polygon and to prepare them for subsequent processing for solving the main problem. This task is the following basic step (preprocessor) for solving a 2D CSP - arrange all given plates from the project in minimum area. Our preprocessing includes the following main steps: Is polygon clock wise; Remove Wasted Points; Find Intersection Points; Represent the two polygons subtraction by Boolean table.",
"editor": [
{
"familyName": "Georgiev",
"givenName": "Krassimir",
"type": "Person"
},
{
"familyName": "Todorov",
"givenName": "Michail",
"type": "Person"
},
{
"familyName": "Georgiev",
"givenName": "Ivan",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-97277-0_9",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-97276-3",
"978-3-319-97277-0"
],
"name": "Advanced Computing in Industrial Mathematics",
"type": "Book"
},
"keywords": [
"NP-hard combinatorial optimization problem",
"combinatorial optimization problems",
"stock problem",
"optimization problem",
"glass industry",
"mathematical algorithm",
"steel structures",
"intersection points",
"paper industry",
"problem",
"polygons",
"CAD environment",
"basic steps",
"subsequent processing",
"Boolean operations",
"construction industry",
"plate",
"main steps",
"minimum area",
"industry",
"main problems",
"algorithm",
"point",
"rectangle",
"shape",
"concave",
"Boolean tables",
"operation",
"step",
"CSP",
"processing",
"irregular forms",
"preprocessing",
"construction",
"subtraction",
"structure",
"work",
"form",
"table",
"difficulties",
"environment",
"analysis",
"profile",
"clock",
"area",
"task",
"project",
"issues",
"companies",
"aim",
"paper"
],
"name": "Analyses and Boolean Operation of 2D Polygons",
"pagination": "107-118",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1107272558"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-97277-0_9"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-97277-0_9",
"https://app.dimensions.ai/details/publication/pub.1107272558"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:46",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_305.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-97277-0_9"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_9'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_9'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_9'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_9'
This table displays all metadata directly associated to this object as RDF triples.
128 TRIPLES
23 PREDICATES
76 URIs
69 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-319-97277-0_9 | schema:about | anzsrc-for:09 |
2 | ″ | ″ | anzsrc-for:0905 |
3 | ″ | schema:author | N6e96833e111a4cef907c5991b9f60974 |
4 | ″ | schema:datePublished | 2018-09-28 |
5 | ″ | schema:datePublishedReg | 2018-09-28 |
6 | ″ | schema:description | The 2D cutting stock problem (CSP) arises in many industries as paper industry, glass industry, biding construction and so on. In paper and glass industries the cutting shapes are rectangles. In building constructions industry the cutting shapes are postilions, which can have irregular form and can be convex and concave. This increases the difficulty of the problem. In our work we concentrated on 2D cutting stock problem, coming from building industry. Many manufactures companies, which build steel structures, have to cut plates and profiles. The CSP is well known like NP-hard combinatorial optimization problem. The plates are represented like 2D polygons in any CAD environment. The aim of this issue is to apply some mathematical algorithms on each polygon and to prepare them for subsequent processing for solving the main problem. This task is the following basic step (preprocessor) for solving a 2D CSP - arrange all given plates from the project in minimum area. Our preprocessing includes the following main steps: Is polygon clock wise; Remove Wasted Points; Find Intersection Points; Represent the two polygons subtraction by Boolean table. |
7 | ″ | schema:editor | N9e48dd94cdd64b8a8d44208f048bf504 |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | false |
11 | ″ | schema:isPartOf | N18491dc8bfec49549772617f3a69cd8c |
12 | ″ | schema:keywords | Boolean operations |
13 | ″ | ″ | Boolean tables |
14 | ″ | ″ | CAD environment |
15 | ″ | ″ | CSP |
16 | ″ | ″ | NP-hard combinatorial optimization problem |
17 | ″ | ″ | aim |
18 | ″ | ″ | algorithm |
19 | ″ | ″ | analysis |
20 | ″ | ″ | area |
21 | ″ | ″ | basic steps |
22 | ″ | ″ | clock |
23 | ″ | ″ | combinatorial optimization problems |
24 | ″ | ″ | companies |
25 | ″ | ″ | concave |
26 | ″ | ″ | construction |
27 | ″ | ″ | construction industry |
28 | ″ | ″ | difficulties |
29 | ″ | ″ | environment |
30 | ″ | ″ | form |
31 | ″ | ″ | glass industry |
32 | ″ | ″ | industry |
33 | ″ | ″ | intersection points |
34 | ″ | ″ | irregular forms |
35 | ″ | ″ | issues |
36 | ″ | ″ | main problems |
37 | ″ | ″ | main steps |
38 | ″ | ″ | mathematical algorithm |
39 | ″ | ″ | minimum area |
40 | ″ | ″ | operation |
41 | ″ | ″ | optimization problem |
42 | ″ | ″ | paper |
43 | ″ | ″ | paper industry |
44 | ″ | ″ | plate |
45 | ″ | ″ | point |
46 | ″ | ″ | polygons |
47 | ″ | ″ | preprocessing |
48 | ″ | ″ | problem |
49 | ″ | ″ | processing |
50 | ″ | ″ | profile |
51 | ″ | ″ | project |
52 | ″ | ″ | rectangle |
53 | ″ | ″ | shape |
54 | ″ | ″ | steel structures |
55 | ″ | ″ | step |
56 | ″ | ″ | stock problem |
57 | ″ | ″ | structure |
58 | ″ | ″ | subsequent processing |
59 | ″ | ″ | subtraction |
60 | ″ | ″ | table |
61 | ″ | ″ | task |
62 | ″ | ″ | work |
63 | ″ | schema:name | Analyses and Boolean Operation of 2D Polygons |
64 | ″ | schema:pagination | 107-118 |
65 | ″ | schema:productId | N3d165179656d41a49994fe05ed06e461 |
66 | ″ | ″ | N78cf5e0a247142c9a147c6cbc97b7ac3 |
67 | ″ | schema:publisher | N142a9b5a34504b8293daa0b5ceb88d9c |
68 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1107272558 |
69 | ″ | ″ | https://doi.org/10.1007/978-3-319-97277-0_9 |
70 | ″ | schema:sdDatePublished | 2022-05-10T10:46 |
71 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
72 | ″ | schema:sdPublisher | N2ede66b354b54ea297d3923c5751b981 |
73 | ″ | schema:url | https://doi.org/10.1007/978-3-319-97277-0_9 |
74 | ″ | sgo:license | sg:explorer/license/ |
75 | ″ | sgo:sdDataset | chapters |
76 | ″ | rdf:type | schema:Chapter |
77 | N142a9b5a34504b8293daa0b5ceb88d9c | schema:name | Springer Nature |
78 | ″ | rdf:type | schema:Organisation |
79 | N18491dc8bfec49549772617f3a69cd8c | schema:isbn | 978-3-319-97276-3 |
80 | ″ | ″ | 978-3-319-97277-0 |
81 | ″ | schema:name | Advanced Computing in Industrial Mathematics |
82 | ″ | rdf:type | schema:Book |
83 | N2ede66b354b54ea297d3923c5751b981 | schema:name | Springer Nature - SN SciGraph project |
84 | ″ | rdf:type | schema:Organization |
85 | N3d165179656d41a49994fe05ed06e461 | schema:name | dimensions_id |
86 | ″ | schema:value | pub.1107272558 |
87 | ″ | rdf:type | schema:PropertyValue |
88 | N43336d096d754741b76c2a4575da6afd | schema:familyName | Georgiev |
89 | ″ | schema:givenName | Krassimir |
90 | ″ | rdf:type | schema:Person |
91 | N49879dfe651944109165fbb1414c5272 | rdf:first | sg:person.011173106320.18 |
92 | ″ | rdf:rest | rdf:nil |
93 | N5ae89b434ca3467691449f28e4e2cda4 | schema:familyName | Georgiev |
94 | ″ | schema:givenName | Ivan |
95 | ″ | rdf:type | schema:Person |
96 | N6e96833e111a4cef907c5991b9f60974 | rdf:first | sg:person.07366160356.00 |
97 | ″ | rdf:rest | N49879dfe651944109165fbb1414c5272 |
98 | N78cf5e0a247142c9a147c6cbc97b7ac3 | schema:name | doi |
99 | ″ | schema:value | 10.1007/978-3-319-97277-0_9 |
100 | ″ | rdf:type | schema:PropertyValue |
101 | N8e2842f52bc744d7b2d8b60d903f44d8 | schema:familyName | Todorov |
102 | ″ | schema:givenName | Michail |
103 | ″ | rdf:type | schema:Person |
104 | N9c4b3ecb29e34c95a555957edb6e9ca5 | rdf:first | N5ae89b434ca3467691449f28e4e2cda4 |
105 | ″ | rdf:rest | rdf:nil |
106 | N9e48dd94cdd64b8a8d44208f048bf504 | rdf:first | N43336d096d754741b76c2a4575da6afd |
107 | ″ | rdf:rest | Nd037dfdf605f48f3ab27680dcaf17f07 |
108 | Nd037dfdf605f48f3ab27680dcaf17f07 | rdf:first | N8e2842f52bc744d7b2d8b60d903f44d8 |
109 | ″ | rdf:rest | N9c4b3ecb29e34c95a555957edb6e9ca5 |
110 | anzsrc-for:09 | schema:inDefinedTermSet | anzsrc-for: |
111 | ″ | schema:name | Engineering |
112 | ″ | rdf:type | schema:DefinedTerm |
113 | anzsrc-for:0905 | schema:inDefinedTermSet | anzsrc-for: |
114 | ″ | schema:name | Civil Engineering |
115 | ″ | rdf:type | schema:DefinedTerm |
116 | sg:person.011173106320.18 | schema:affiliation | grid-institutes:grid.410344.6 |
117 | ″ | schema:familyName | Fidanova |
118 | ″ | schema:givenName | Stefka |
119 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011173106320.18 |
120 | ″ | rdf:type | schema:Person |
121 | sg:person.07366160356.00 | schema:affiliation | grid-institutes:grid.410344.6 |
122 | ″ | schema:familyName | Evtimov |
123 | ″ | schema:givenName | Georgi |
124 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07366160356.00 |
125 | ″ | rdf:type | schema:Person |
126 | grid-institutes:grid.410344.6 | schema:alternateName | Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria |
127 | ″ | schema:name | Institute of Information and Communication Technology, Bulgarian Academy of Science, Sofia, Bulgaria |
128 | ″ | rdf:type | schema:Organization |