Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.07225

Modeling of non-planar slicer for improved surface quality in material extrusion 3D printing

Shadman Tajwar Shahid
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces an algorithm to generate a 3D extruder path, combining classic planar and non-planar layers to enhance the surface quality and accuracy of complex 3D printed parts. Material extrusion 3D printing, due to its layer-by-layer construction method, produces parts with a discretization effect commonly referred to as the "staircase" effect, particularly on near-flat surfaces. The algorithm addresses this issue using a mixed-layer approach that uses 3D non-planar layers for the surfaces that would benefit from non-planar printing, and planar layers for the remaining regions. Existing studies have demonstrated similar combined layer methods but are often limited in the variety and complexity of shapes they can process due to their inherent slicing techniques. This algorithm presents a universal approach to non-planar extruder path generation by identifying the non-planar surfaces and generating non-planar extruder paths that conform to the object's surface. Subsequently, it identifies the space occupied by the non-planar layers and removes it from the original mesh to produce a collision-free planar-only mesh, sliced using classic planar methods. The algorithm was evaluated on objects of various complex shapes, comparing the results with outputs from standard planar slicers. The improvement in surface accuracy was also quantified by measuring the Chamfer Distance. Specifically, it is shown that the algorithm can generate non-planar extruder paths of complex geometries, improving surface quality.

Explore related subjects

cs.CG

Keep this discovery

BibTeXRIS

Shadman Tajwar Shahid. 2024-11-11. Modeling of non-planar slicer for improved surface quality in material extrusion 3D printing. https://arxiv.org/abs/2411.07225

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗