Home > Research > Publications & Outputs > An Efficient Triangle Mesh Slicing Algorithm fo...

Electronic data

Links

Text available via DOI:

View graph of relations

An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing. / King, Beth; Rennie, Allan; Bennett, Graham R.

In: International Journal of Advanced Manufacturing Technology, Vol. 112, 01.01.2021, p. 1023-1033.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

King, B, Rennie, A & Bennett, GR 2021, 'An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing', International Journal of Advanced Manufacturing Technology, vol. 112, pp. 1023-1033. https://doi.org/10.1007/s00170-020-06396-2

APA

King, B., Rennie, A., & Bennett, G. R. (2021). An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing. International Journal of Advanced Manufacturing Technology, 112, 1023-1033. https://doi.org/10.1007/s00170-020-06396-2

Vancouver

King B, Rennie A, Bennett GR. An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing. International Journal of Advanced Manufacturing Technology. 2021 Jan 1;112:1023-1033. https://doi.org/10.1007/s00170-020-06396-2

Author

King, Beth ; Rennie, Allan ; Bennett, Graham R. / An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing. In: International Journal of Advanced Manufacturing Technology. 2021 ; Vol. 112. pp. 1023-1033.

Bibtex

@article{5f65f3c9afaf47cd8f9bada4d068bb20,
title = "An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing",
abstract = "To date, slicing algorithms for additive manufacturing are most effective for favourable triangular mesh topologies; worst case models, where a large percentage of triangles intersect each slice-plane, take significantly longer to slice than a like-for-like file. In larger files, this results in a significant slicing duration, when models are both worst case and contain more than 100,000 triangles. The research presented here introduces a slicing algorithm which can slice worst case large models effectively. A new algorithm is implemented utilising an efficient contour construction method, with further adaptations, which make the algorithm suitable for all model topologies. Edge matching, which is an advanced sorting method, decreases the number of sorts per edge from n total number of intersections to two, alongside additional micro-optimisations that deliver the enhanced efficient contour construction algorithm. The algorithm was able to slice a worst-case model of 2.5 million triangles in 1025s. Maximum improvement was measured as 9,400% over the standard efficient contour construction method. Improvements were also observed in all parts in excess of 1000 triangles. The slicing algorithm presented offers novel methods that address the failings of other algorithms described in literature to slice worst case models effectively.",
keywords = "Additive Manufacturing, Slicing Algorithm, Efficiency, Computational Geometry, Rapid Prototyping",
author = "Beth King and Allan Rennie and Bennett, {Graham R.}",
year = "2021",
month = jan,
day = "1",
doi = "10.1007/s00170-020-06396-2",
language = "English",
volume = "112",
pages = "1023--1033",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",

}

RIS

TY - JOUR

T1 - An Efficient Triangle Mesh Slicing Algorithm for All Topologies in Additive Manufacturing

AU - King, Beth

AU - Rennie, Allan

AU - Bennett, Graham R.

PY - 2021/1/1

Y1 - 2021/1/1

N2 - To date, slicing algorithms for additive manufacturing are most effective for favourable triangular mesh topologies; worst case models, where a large percentage of triangles intersect each slice-plane, take significantly longer to slice than a like-for-like file. In larger files, this results in a significant slicing duration, when models are both worst case and contain more than 100,000 triangles. The research presented here introduces a slicing algorithm which can slice worst case large models effectively. A new algorithm is implemented utilising an efficient contour construction method, with further adaptations, which make the algorithm suitable for all model topologies. Edge matching, which is an advanced sorting method, decreases the number of sorts per edge from n total number of intersections to two, alongside additional micro-optimisations that deliver the enhanced efficient contour construction algorithm. The algorithm was able to slice a worst-case model of 2.5 million triangles in 1025s. Maximum improvement was measured as 9,400% over the standard efficient contour construction method. Improvements were also observed in all parts in excess of 1000 triangles. The slicing algorithm presented offers novel methods that address the failings of other algorithms described in literature to slice worst case models effectively.

AB - To date, slicing algorithms for additive manufacturing are most effective for favourable triangular mesh topologies; worst case models, where a large percentage of triangles intersect each slice-plane, take significantly longer to slice than a like-for-like file. In larger files, this results in a significant slicing duration, when models are both worst case and contain more than 100,000 triangles. The research presented here introduces a slicing algorithm which can slice worst case large models effectively. A new algorithm is implemented utilising an efficient contour construction method, with further adaptations, which make the algorithm suitable for all model topologies. Edge matching, which is an advanced sorting method, decreases the number of sorts per edge from n total number of intersections to two, alongside additional micro-optimisations that deliver the enhanced efficient contour construction algorithm. The algorithm was able to slice a worst-case model of 2.5 million triangles in 1025s. Maximum improvement was measured as 9,400% over the standard efficient contour construction method. Improvements were also observed in all parts in excess of 1000 triangles. The slicing algorithm presented offers novel methods that address the failings of other algorithms described in literature to slice worst case models effectively.

KW - Additive Manufacturing

KW - Slicing Algorithm

KW - Efficiency

KW - Computational Geometry

KW - Rapid Prototyping

U2 - 10.1007/s00170-020-06396-2

DO - 10.1007/s00170-020-06396-2

M3 - Journal article

VL - 112

SP - 1023

EP - 1033

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

ER -