.png){kind=icon}
.png){kind=icon}
Return
An Efficient Algorithm for Approximate Polyline-Sourced Offset Computation on Triangulated Surfaces
.png){kind=icon}
PRE
AI
DOI：10.26599/TST.2024.9010239.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The computation of polyline-sourced geodesic offset holds significant importance in a variety of applications, including but not limited to solid modeling, tool path generation for computer numerical control (CNC) machining, and parametrization. The traditional approaches for geodesic offsets have typically relied on the availability of an exact geodesic metric. Nevertheless, the computation of exact geodesics is characterized by its time-consuming nature and substantial memory usage. To tackle the limitation, our study puts forward a novel approach that seeks to circumvent the reliance on exact geodesic metrics. The proposed method entails a reformulated graph method that incorporates Steiner point insertion, serving as an effective solution for obtaining geodesic distances. By leveraging the aforementioned strategies, we present an efficient and robust algorithm designed for the computation of polyline-sourced geodesic offsets. The experimental evaluation, conducted on a diverse set of three-dimensional models, demonstrates significant improvements in computational speed and memory requirements compared to established state-of-the-art methods.
Keywords:
Measurement
Steiner trees
Solid modeling
Memory management
Machining
Approximation algorithms
Path planning
Computational efficiency
Numerical models
Computer numerical control
geodesic offsets
graph-based algorithm
computer numerical control (CNC) milling
tool path planning
Journal
T
IF:
3.5
Papers:
987
Citations:
2.5K