openscad/round-anything
1
0
Fork 0
mirror of https://github.com/Irev-Dev/Round-Anything.git synced 2025-01-17 02:58:14 +01:00
Code Issues Releases Wiki Activity

Update unionRoundMask-Doc.md.scad

Browse Source
This commit is contained in:
TLC123 2021-08-23 15:03:51 +02:00 committed by GitHub
parent e9d3d805ab
commit e9faa0785d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
unionRoundMask-Doc.md.scad
View File

@ -1,4 +1,4 @@
#unionRoundMask # unionRoundMask
module unionRoundMask(r=1, detail = 5 , q=70, epsilon = 1e-6, showMask = true) module unionRoundMask(r=1, detail = 5 , q=70, epsilon = 1e-6, showMask = true)
Masks are a method to perform unionRound on selected only areas Masks are a method to perform unionRound on selected only areas
@ -18,7 +18,7 @@ unionRoundMask(r=1,detail=3,q=30)
// ... // ...
} }
#unionRound # unionRound
module unionRound(r=1, detail = 5 , q=70, epsilon = 1e-6) module unionRound(r=1, detail = 5 , q=70, epsilon = 1e-6)
Module unionRound is the underlying work module of unionRoundMask. Module unionRound is the underlying work module of unionRoundMask.
@ -32,16 +32,17 @@ unionRoundMask(r=1,detail=3,q=30)
} }
#intersectionRound # intersectionRound
module intersectionRound(r, q=70, epsilon = 1e-6,showOperands = true) { module intersectionRound(r, q=70, epsilon = 1e-6,showOperands = true) {
Undocumented for now. Undocumented for now.
//helpers # helpers
module clad(r,q=70) // speed is limited to convex operand module clad(r,q=70) // speed is limited to convex operand
module shell(r,q=70) // not in use module shell(r,q=70) // not in use
module inset(r,q=20) // speed is limited to convex operand module inset(r,q=20) // speed is limited to convex operand
## Citation ## Citation
roundUnionMask Includes code based on examples from: roundUnionMask Includes code based on examples from:
Kogan, Jonathan (2017) "A New Computationally Efficient Method for Spacing n Points on a Sphere," Rose-Hulman Undergraduate Mathematics Journal: Vol. 18 : Iss. 2 , Article 5. Kogan, Jonathan (2017) "A New Computationally Efficient Method for Spacing n Points on a Sphere," Rose-Hulman Undergraduate Mathematics Journal: Vol. 18 : Iss. 2 , Article 5.
Available at: [https://scholar.rose-hulman.edu/rhumj/vol18/iss2/5] Available at: [https://scholar.rose-hulman.edu/rhumj/vol18/iss2/5]