2018
DOI: 10.1007/978-3-319-97277-0_9
|View full text |Cite
|
Sign up to set email alerts
|

Analyses and Boolean Operation of 2D Polygons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…This path planning method needs to judge the contour shape of each layer, distinguish the inner contour from the outer contour, and offset the outer contour outward or inward according to the inner contour [13]. If more than one cavity is involved, it also needs the boolean operation to judge whether the various offsets intersect [14]. After processing the intersections, the corresponding closed filling path can be obtained, which is generally circle lines parallel to the inner contour or the outer contour.…”
Section: Contour Offset Filling Methodsmentioning
confidence: 99%
“…This path planning method needs to judge the contour shape of each layer, distinguish the inner contour from the outer contour, and offset the outer contour outward or inward according to the inner contour [13]. If more than one cavity is involved, it also needs the boolean operation to judge whether the various offsets intersect [14]. After processing the intersections, the corresponding closed filling path can be obtained, which is generally circle lines parallel to the inner contour or the outer contour.…”
Section: Contour Offset Filling Methodsmentioning
confidence: 99%