2019
DOI: 10.1016/j.cad.2019.05.014
|View full text |Cite
|
Sign up to set email alerts
|

Accessibility for Line-Cutting in Freeform Surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 34 publications
0
2
0
Order By: Relevance
“…Computing C−obstacles for arbitrary shapes can be challenging, depending on the choice of representation. For 5-axis machining applications, one of the six DOF for rotation around the tool axis is deemed redundant and the problem is simplified by assuming simple shapes for the rotating tool's closure such as a flat/ball-end cylinders, approximating reachability by visibility, and so on [34][35][36][37][38][39][40][41]. However, the computations can be dramatically simplified by sampling-based approximations [42].…”
Section: Related Workmentioning
confidence: 99%
“…Computing C−obstacles for arbitrary shapes can be challenging, depending on the choice of representation. For 5-axis machining applications, one of the six DOF for rotation around the tool axis is deemed redundant and the problem is simplified by assuming simple shapes for the rotating tool's closure such as a flat/ball-end cylinders, approximating reachability by visibility, and so on [34][35][36][37][38][39][40][41]. However, the computations can be dramatically simplified by sampling-based approximations [42].…”
Section: Related Workmentioning
confidence: 99%
“…Another class of relevant research deals with the approximation of general free-form (NURBS) surfaces by ruled surfaces [20,44], or even developable surfaces [34,35,39,41,42]. For simple geometries, the process of approximation can be even interactive, while the design of very complex shapes requires many rounds of optimization and is still beyond real-time performance [42].…”
Section: Previous Workmentioning
confidence: 99%
“…[10] studied the algorithm for cutting polyhedral shapes with a hot wire cutter, utilizing computational geometry techniques to solve the problems of lines and segments in the cutting process. Particularly used in recent years when fabricating freeform geometries, in order to find collision-free tangential cutting directions, a conservative algorithm for line cutting with a wire cutter was presented by [11], which provided advanced techniques to remove large amounts of material. Exploring the material cutting of 2D or 3D geometric shapes, in [12], an approximation algorithm for cutting out convex polygons was presented, which can cut convex polygons from the plane at a minimum cost by designing an optimal cutting sequence.…”
Section: Introductionmentioning
confidence: 99%
“…Despite some of the new algorithms and analysis methods being investigated in [11,14], to the best of our knowledge, the theoretical research available on the optimization strategies of block sawing with a circular saw blade for special-shaped stone in the rough machining stage is currently sparse. This is due to the need to touch upon the convex polyhedron (CPH) reconstruction techniques of computational geometry and computer graphics, and the constraints of cutter head feeding along a straight line in the cutting process.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation