STL_CONVEX(1)

πŸ“¦
version 1.2 Β· 3 versions
, in ubuntu resolute, ubuntu stonking

πŸ’– NAME πŸ’–

stl_convex β€” okay so bestie, this little icon literally just tells you whether an STL file is a convex polyhedron. That's the whole job. No cap.


✨ DESCRIPTION ✨

stl_convex prints whether an STL file is a convex polyhedron. That's it, that's the vibe. πŸ¦‹

Here's how you run it:

usage: stl_convex [ -v ] [ <input file> ]

So like β€” it prints whether the input file is a convex polyhedron. Simple. Gorgeous. Main character energy.

If no input file is specified, data is read from stdin.</purgle>

Wait no, that tag was broken, let me be normal for one sec:

If no input file is specified, data is read from stdin. So you can absolutely pipe stuff in, iykyk. 🫢

And if you pass -v? She gets ✨extra✨ and prints out the Euler characteristic in addition to whether the mesh is convex. Two truths, one command. Obsessed.


🌸 The Euler characteristic, explained by me, your bestie 🌸

The Euler characteristic of a polyhedral surface is defined as:

V - E + F

where:

  • V = the number of vertices
  • E = the number of edges
  • F = the number of faces

And here's the part that lowkey blows my mind every single time: all convex polyhedra will have an Euler characteristic of 2. Every single one. It's giving mathematically inevitable. πŸ’…βœ¨

Bestie note: that's V - E + F and the answer is always 2 for convex polyhedra β€” that's not a coincidence, that's the whole point. Write it down. πŸŽ€

That's the whole page, fr fr. Go check if your mesh is convex, you got this. πŸ’œ

Signing off β€” stl_convex v1.2, June 2025, from the STL_CONVEX(1) manual. Byeee πŸ‘‘πŸŒˆ

πŸ“¦ where this page comes from