gsdf is a CAD 3D design library for Go that uses SDFs for shape definition. Rendering can be done on GPU or CPU
for visualization or 3D printing file outputs. Quick jump to usage: bolt example.
All images and shapes in readme were generated using this library.
-
Extremely coherent API design.
-
UI for visualizing parts, rendered directly from shaders. See UI example by running
go run ./examples/ui-mandala -
Generate visualization for your parts as shaders.
-
GPU and CPU implementations for all shapes and operations. CPU implementations are actually faster for simple parts.
-
Include arbitrary buffers into GPU calculation. See
Shaderinterface. -
Heapless algorithms for everything. No usage of GC in happy path.
-
Heapless Octree triangle renderer. Is stupid fast.
- Design your part using one API, switch between CPU and GPU after design.
-
TinyGo supported for CPU evaluation :)
gsdf: Top level package defines exact SDFs primitives and operations for use on CPU or GPU workloads. Consumesglbuildinterfaces and logic to build shaders.glbuild: Automatic shader generation interfaces and logic.gleval: SDF evaluation interfaces and facilities, both CPU and GPU bound.glrender: Triangle rendering logic which consumes gleval. STL generation.forge: Composed shape generation such asthreadspackage for generating screw threads. Engineering applications.gsdfaux: High level helper functions to get users started up withgsdf. See examples.
Find examples under examples directory. Run on GPU with: -gpu flag.
Most 3D examples output two files:
example-name.glsl: Visualization shader that can be copy pasted into shadertoy to visualize the part, or rendered within your editor with an extension such as the Shader Toy Visual Studio Code extension.example-name.stl: Triangle model file used in 3D printing software such as Cura. Can be visualized online in sites such as View STL.
Output and timings for
- CPU: 12th Gen Intel i5-12400F (12) @ 4.400GHz
- GPU: AMD ATI Radeon RX 6800
This was converted from the original sdf library example.
time go run ./examples/npt-flange -resdiv 400 -gpu
using GPU ᵍᵒᵗᵗᵃ ᵍᵒ ᶠᵃˢᵗ
compute invocation size 1024
instantiating evaluation SDF took 115.587024ms
wrote nptflange.glsl in 97.829µs
evaluated SDF 46148621 times and rendered 423852 triangles in 1.103100086s with 95.7 percent evaluations omitted
wrote nptflange.stl in 710.038498ms
finished npt-flange example
go run ./examples/npt-flange -resdiv 400 -gpu 1,01s user 1,10s system 95% cpu 2,217 totaltime go run ./examples/npt-flange -resdiv 400
using CPU
instantiating evaluation SDF took 14.173µs
wrote nptflange.glsl in 73.155µs
evaluated SDF 46147934 times and rendered 423852 triangles in 8.482344469s with 95.7 percent evaluations omitted
wrote nptflange.stl in 703.931017ms
finished npt-flange example
go run ./examples/npt-flange -resdiv 400 9,01s user 0,82s system 103% cpu 9,481 total
Note that the amount of triangles is very similar to the NPT flange example, but the speedup is much more notable due to the complexity of the part.
time go run ./examples/fibonacci-showerhead -resdiv 350 -gpu
using GPU ᵍᵒᵗᵗᵃ ᵍᵒ ᶠᵃˢᵗ
compute invocation size 1024
instantiating evaluation SDF took 108.241558ms
wrote showerhead.glsl in 581.351µs
evaluated SDF 14646305 times and rendered 309872 triangles in 768.731027ms with 89.08 percent evaluations omitted
wrote showerhead.stl in 509.470328ms
showerhead example done
go run ./examples/fibonacci-showerhead -resdiv 350 -gpu 0,87s user 0,69s system 94% cpu 1,646 totaltime go run ./examples/fibonacci-showerhead -resdiv 350
using CPU
instantiating evaluation SDF took 27.757µs
wrote showerhead.glsl in 507.155µs
evaluated SDF 14645989 times and rendered 309872 triangles in 35.794768353s with 89.08 percent evaluations omitted
wrote showerhead.stl in 499.13903ms
SDF caching omitted 21.62 percent of 14645989 SDF evaluations
showerhead example done
go run ./examples/fibonacci-showerhead -resdiv 350 36,16s user 0,76s system 100% cpu 36,591 total
