Computing feasible toolpaths for 5-axis machines
From MaRDI portal
Publication:443707
DOI10.1016/j.tcs.2011.11.032zbMath1243.68307MaRDI QIDQ443707
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.032
68U07: Computer science aspects of computer-aided design
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A machining potential field approach to tool path generation for multi-axis sculptured surface machining
- Visibility maps and spherical algorithms
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining
- Incidence matrices and interval graphs
- Representation of a finite graph by a set of intervals on the real line
- Free-Form Surface Partition in 3-D
- New Upper Bounds in Klee’s Measure Problem
- IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
- Finding an optimal path without growing the tree
- FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES
- An optimization algorithm for free-form surface partitioning based on weighted gaussian image
- A Characterization of Comparability Graphs and of Interval Graphs