ScholarLens Back to search
2008•Journal of Computer ApplicationsRequires access

Modified fast algorithm for STL file slicing

Chengke Wu

Open publisher page 2 citations

Abstract

STL is an Ad Hoc standard in rapid prototyping manufacturing.An efficient STL slicing algorithm is necessary for high quality prototype production.In this paper,we proposed a fast slicing algorithm based on recursion and searching direct graph with weight.In this method,the time consuming of creating direct graph was eliminated.Then the slicing data was postprocessed to get rid of the redundant points.Thus the slicing speed can be accelerated substantially.Lots of experiments and data analysis validate our new slicing algorithm.

About this research paper

What this paper is about

STL is an Ad Hoc standard in rapid prototyping manufacturing.An efficient STL slicing algorithm is necessary for high quality prototype production.In this paper,we proposed a fast slicing algorithm based on recursion and searching direct graph with weight.In this method,the time consuming of creating direct graph was eliminated.Then the slicing data was postprocessed to get rid of the redundant points.Thus the slicing speed can be accelerated substantially.Lots of experiments and data analysis validate our new slicing algorithm.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

STL is an Ad Hoc standard in rapid prototyping manufacturing.An efficient STL slicing algorithm is necessary for high quality prototype production.In this paper,we proposed a fast slicing algorithm based on recursion and searching direct graph with weight.In this method,the time consuming of creating direct graph was eliminated.Then the slicing data was postprocessed to get rid of the redundant points.Thus the slicing speed can be accelerated substantially.Lots of experiments and data analysis validate our new slicing algorithm.

Key concepts: Slicing, Computer science, Program slicing, Rapid prototyping, Algorithm, Graph, Recursion (computer science), Parallel computing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Modified fast algorithm for STL file slicing — Research Paper | ScholarLens