2019-07-13 00:17:36 +00:00
//////////////////////////////////////////////////////////////////////
2019-07-13 22:57:24 +00:00
// LibFile: rounding.scad
2019-07-13 00:17:36 +00:00
// Routines to create rounded corners, with either circular rounding,
// or continuous curvature rounding with no sudden curvature transitions.
// To use, add the following lines to the beginning of your file:
// ```
// include <BOSL2/std.scad>
2019-07-13 22:57:24 +00:00
// include <BOSL2/rounding.scad>
2019-07-13 00:17:36 +00:00
// ```
//////////////////////////////////////////////////////////////////////
2020-03-05 22:05:23 +00:00
include < beziers.scad >
include < strings.scad >
include < structs.scad >
include < skin.scad >
2019-07-13 00:17:36 +00:00
// CommonCode:
// $fn=36;
// Section: Functions
// Function: round_corners()
//
2020-05-21 20:47:12 +00:00
// Usage:
// round_corners(path, [method], [radius], [cut], [joint], [closed], [verbose]);
//
2019-07-13 00:17:36 +00:00
// Description:
2020-05-21 20:47:12 +00:00
// Takes a 2D or 3D path as input and rounds each corner
2019-07-13 00:17:36 +00:00
// by a specified amount. The rounding at each point can be different and some points can have zero
2020-05-21 20:47:12 +00:00
// rounding. The `round_corners()` function supports three types of corner treatment: chamfers, circular rounding,
// and continuous curvature rounding using 4th order bezier curves. Circular rounding can produce a
2019-07-13 00:17:36 +00:00
// tactile "bump" where the curvature changes from flat to circular.
// See https://hackernoon.com/apples-icons-have-that-shape-for-a-very-good-reason-720d4e7c8a14
//
2020-05-21 20:47:12 +00:00
// You select the type of rounding using the `method` option, which should be `"smooth"` to
2020-01-09 23:52:08 +00:00
// get continuous curvature rounding, `"circle"` to get circular rounding, or `"chamfer"` to get chamfers. The default is circle
2020-05-21 20:47:12 +00:00
// rounding. Each method has two options you can use to specify the amount of rounding.
// All of the rounding methods accept the cut option. This mode specifies the distance from the unrounded corner to the rounded tip, so how
// much of the corner to "cut" off. This can be easier to understand than setting a circular radius, which can be
2019-07-13 00:17:36 +00:00
// unexpectedly extreme when the corner is very sharp. It also allows a systematic specification of
2020-05-21 20:47:12 +00:00
// corner treatments that are the same size for all three methods.
2019-07-13 00:17:36 +00:00
//
2020-05-21 20:47:12 +00:00
// For circular rounding you can also use the `radius` parameter, which sets a circular rounding
// radius. For chamfers and smooth rounding you can speicfy the `joint` parameter, which specifies the distance
2020-01-09 23:52:08 +00:00
// away from the corner along the path where the roundover or chamfer should start. The figure below shows
2020-05-20 04:56:09 +00:00
// the cut and joint distances for a given roundover.
2019-07-13 00:17:36 +00:00
//
2020-05-21 20:47:12 +00:00
// The `"smooth"` method rounding also has a parameter that specifies how smooth the curvature match
2019-07-13 00:17:36 +00:00
// is. This parameter, `k`, ranges from 0 to 1, with a default of 0.5. Larger values give a more
// abrupt transition and smaller ones a more gradual transition. If you set the value much higher
// than 0.8 the curvature changes abruptly enough that though it is theoretically continuous, it may
// not be continous in practice. If you set it very small then the transition is so gradual that
// the length of the roundover may be extremely long.
//
2020-05-21 20:47:12 +00:00
// If you select curves that are too large to fit the function will fail with an error. You can set `verbose=true` to
// get a message showing a list of scale factors you can apply to your rounding paramets so that the
// roundovers will fit on the curve. If the scale factors are larger than one
2019-07-13 00:17:36 +00:00
// then they indicate how much you can increase the curve sizes before collisions will occur.
//
2020-05-21 20:47:12 +00:00
// The parameters `radius`, `cut`, `joint` and `k` can be numbers, which round every corner using the same parameters, or you
// can specify a list to round each corner with different parameters. If the curve is not closed then the first and last points
// of the curve are not rounded. In this case you can specify a full list of points anyway, and the endpoint values are ignored,
// or you can specify a list that has length len(path)-2, omitting the two dummy values.
2019-07-13 00:17:36 +00:00
// Examples:
2020-05-21 20:47:12 +00:00
// * `method="circle", radius=2`:
2019-07-13 00:17:36 +00:00
// Rounds every point with circular, radius 2 roundover
2020-05-21 20:47:12 +00:00
// * `method="smooth", cut=2`:
2019-07-13 00:17:36 +00:00
// Rounds every point with continuous curvature rounding with a cut of 2, and a default 0.5 smoothing parameter
2020-05-21 20:47:12 +00:00
// * `method="smooth", cut=2, k=0.3`:
2019-07-13 00:17:36 +00:00
// Rounds every point with continuous curvature rounding with a cut of 2, and a very gentle 0.3 smoothness setting
//
// The number of segments used for roundovers is determined by `$fa`, `$fs` and `$fn` as usual for
// circular roundovers. For continuous curvature roundovers `$fs` and `$fn` are used and `$fa` is
2020-05-21 20:47:12 +00:00
// ignored. Note that $fn is interpreted as the number of points on the roundover curve, which is
// not equivalent to its meaning for rounding circles because roundovers are usually small fractions
// of a circular arc. When doing continuous curvature rounding be sure to use lots of segments or the effect
2019-07-13 00:17:36 +00:00
// will be hidden by the discretization.
//
// Figure(2DMed):
// h = 18;
// w = 12.6;
// example = [[0,0],[w,h],[2*w,0]];
2020-05-21 20:47:12 +00:00
// color("red")stroke(round_corners(example, joint=18, method="smooth",closed=false),width=.1);
2019-07-13 00:17:36 +00:00
// stroke(example, width=.1);
// color("green")stroke([[w,h], [w,h-cos(vector_angle(example)/2) *3/8*h]], width=.1);
// ll=lerp([w,h], [0,0],18/norm([w,h]-[0,0]) );
// color("blue")stroke(_shift_segment([[w,h], ll], -.7), width=.1);
// color("green")translate([w-.3,h-4])scale(.1)rotate(90)text("cut");
// color("blue")translate([w/2-1.1,h/2+.6]) scale(.1)rotate(90-vector_angle(example)/2)text("joint");
2019-07-24 05:49:23 +00:00
//
2019-07-13 00:17:36 +00:00
// Arguments:
2020-05-21 20:47:12 +00:00
// path = list of 2d or 3d points defining the path to be rounded.
// method = rounding method to use. Set to "chamfer" for chamfers, "circle" for circular rounding and "smooth" for continuous curvature 4th order bezier rounding. Default: "circle"
// radius = rounding radius, only compatible with `method="circle"`. Can be a number or vector.
// cut = rounding cut distance, compatible with all methods. Can be a number or vector.
// joint = rounding joint distance, compatible with `method="chamfer"` and `method="smooth"`. Can be a number or vector.
// k = continuous curvature smoothness parameter for `method="smooth"`. Can be a number or vector. Default: 0.5
2019-07-13 00:17:36 +00:00
// closed = if true treat the path as a closed polygon, otherwise treat it as open. Default: true.
2020-05-21 20:47:12 +00:00
// verbose = if true display rounding scale factors that show how close roundovers are to overlapping. Default: false
//
2020-05-20 04:56:09 +00:00
// Example(Med2D): Standard circular roundover with radius the same at every point. Compare results at the different corners.
2019-07-13 00:17:36 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
2020-05-21 20:47:12 +00:00
// polygon(round_corners(shape, radius=1));
2019-07-13 00:17:36 +00:00
// color("red") down(.1) polygon(shape);
2020-05-20 04:56:09 +00:00
// Example(Med2D): Circular roundover using the "cut" specification, the same at every corner.
2019-07-13 00:17:36 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
2020-05-21 20:47:12 +00:00
// polygon(round_corners(shape, cut=1));
2019-07-13 00:17:36 +00:00
// color("red") down(.1) polygon(shape);
2020-05-20 04:56:09 +00:00
// Example(Med2D): Continous curvature roundover using "cut", still the same at every corner. The default smoothness parameter of 0.5 was too gradual for these roundovers to fit, but 0.7 works.
2019-07-13 00:17:36 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
2020-05-21 20:47:12 +00:00
// polygon(round_corners(shape, method="smooth", cut=1, k=0.7));
2019-07-13 00:17:36 +00:00
// color("red") down(.1) polygon(shape);
2020-05-20 04:56:09 +00:00
// Example(Med2D): Continuous curvature roundover using "joint", for the last time the same at every corner. Notice how small the roundovers are.
2019-07-13 00:17:36 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
2020-05-21 20:47:12 +00:00
// polygon(round_corners(shape, method="smooth", joint=1, k=0.7));
2019-07-13 00:17:36 +00:00
// color("red") down(.1) polygon(shape);
// Example(Med2D): Circular rounding, different at every corner, some corners left unrounded
2020-05-21 20:47:12 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
// radii = [1.8, 0, 2, 0.3, 1.2, 0];
// polygon(round_corners(shape, radius = radii), $fn=128);
// color("red") down(.1) polygon(shape);
2019-07-13 00:17:36 +00:00
// Example(Med2D): Continuous curvature rounding, different at every corner, with varying smoothness parameters as well, and `$fs` set very small
2020-05-21 20:47:12 +00:00
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
// cuts = [1.5,0,2,0.3, 1.2, 0];
// k = [0.6, 0.5, 0.5, 0.7, 0.3, 0.5];
// polygon(round_corners(shape, method="smooth", cut=cuts, k=k, $fs=0.1));
// color("red") down(.1) polygon(shape);
2020-01-09 23:52:08 +00:00
// Example(Med2D): Chamfers
// shape = [[0,0], [10,0], [15,12], [6,6], [6, 12], [-3,7]];
2020-05-21 20:47:12 +00:00
// polygon(round_corners(shape, method="chamfer", cut=1));
2020-01-09 23:52:08 +00:00
// color("red") down(.1) polygon(shape);
2020-05-20 04:56:09 +00:00
// Example(Med3D): 3D printing test pieces to display different curvature shapes. You can see the discontinuity in the curvature on the "C" piece in the rendered image.
2020-05-21 20:47:12 +00:00
// $fn=96;
// ten = square(50);
// cut = 5;
2019-07-13 00:17:36 +00:00
// linear_extrude(height=14){
2020-05-21 20:47:12 +00:00
// translate([25,25,0])text("C",size=30, valign="center", halign="center");
2019-07-13 00:17:36 +00:00
// translate([85,25,0])text("5",size=30, valign="center", halign="center");
// translate([85,85,0])text("3",size=30, valign="center", halign="center");
// translate([25,85,0])text("7",size=30, valign="center", halign="center");
// }
// linear_extrude(height=13)
// {
2020-05-21 20:47:12 +00:00
// polygon(round_corners(ten, cut=cut), $fn=96*4);
// translate([60,0,0])polygon(round_corners(ten, method="smooth", cut=cut));
// translate([60,60,0])polygon(round_corners(ten, method="smooth", cut=cut, k=0.32));
// translate([0,60,0])polygon(round_corners(ten, method="smooth", cut=cut, k=0.7));
2020-05-20 04:56:09 +00:00
// }
2019-07-13 00:17:36 +00:00
// Example(Med2D): Rounding a path that is not closed in a three different ways.
2020-05-21 20:47:12 +00:00
// $fs=.1;
2019-07-13 00:17:36 +00:00
// $fa=1;
// zigzagx = [-10, 0, 10, 20, 29, 38, 46, 52, 59, 66, 72, 78, 83, 88, 92, 96, 99, 102, 112];
2020-03-05 04:22:39 +00:00
// zigzagy = concat([0], flatten(repeat([-10,10],8)), [-10,0]);
2019-07-13 00:17:36 +00:00
// zig = zip(zigzagx,zigzagy);
// stroke(zig,width=1); // Original shape
// fwd(20) // Smooth size corners with a cut of 4 and curvature parameter 0.6
2020-05-21 20:47:12 +00:00
// stroke(round_corners(zig,cut=4, k=0.6, method="smooth", closed=false),width=1);
2019-07-13 00:17:36 +00:00
// fwd(40) // Smooth size corners with circular arcs and a cut of 4
2020-05-21 20:47:12 +00:00
// stroke(round_corners(zig,cut=4,closed=false, method="circle"),width=1);
2019-07-13 00:17:36 +00:00
// // Smooth size corners with a circular arc and radius 1.5 (close to maximum possible)
// fwd(60) // Note how the different points are cut back by different amounts
2020-05-21 20:47:12 +00:00
// stroke(round_corners(zig,radius=1.5,closed=false),width=1);
2019-07-13 00:17:36 +00:00
// Example(FlatSpin): Rounding some random 3D paths
// list1= [
// [2.887360, 4.03497, 6.372090],
// [5.682210, 9.37103, 0.783548],
// [7.808460, 4.39414, 1.843770],
// [0.941085, 5.30548, 4.467530],
// [1.860540, 9.81574, 6.497530],
// [6.938180, 7.21163, 5.794530]
// ];
// list2= [
// [1.079070, 4.74091, 6.900390],
// [8.775850, 4.42248, 6.651850],
// [5.947140, 9.17137, 6.156420],
// [0.662660, 6.95630, 5.884230],
// [6.564540, 8.86334, 9.953110],
// [5.420150, 4.91874, 3.866960]
// ];
2020-05-21 20:47:12 +00:00
// path_sweep(regular_ngon(n=36,or=.1),round_corners(list1,closed=false, method="smooth", cut = 0.65));
2020-05-20 04:56:09 +00:00
// right(6)
2020-05-21 20:47:12 +00:00
// path_sweep(regular_ngon(n=36,or=.1),round_corners(list2,closed=false, method="circle", cut = 0.75));
2019-07-13 00:17:36 +00:00
// Example(FlatSpin): Rounding a spiral with increased rounding along the length
// // Construct a square spiral path in 3D
// square = [[0,0],[1,0],[1,1],[0,1]];
2020-03-05 04:22:39 +00:00
// spiral = flatten(repeat(concat(square,reverse(square)),5)); // Squares repeat 10 times, forward and backward
2019-07-13 00:17:36 +00:00
// squareind = [for(i=[0:9]) each [i,i,i,i]]; // Index of the square for each point
2020-05-20 04:56:09 +00:00
// z = list_range(40)*.2+squareind;
2020-01-09 23:52:08 +00:00
// path3d = zip(spiral,z); // 3D spiral
2020-05-20 04:56:09 +00:00
// rounding = squareind/20;
2019-07-13 00:17:36 +00:00
// // Setting k=1 means curvature won't be continuous, but curves are as round as possible
2020-05-20 04:56:09 +00:00
// // Try changing the value to see the effect.
2020-05-21 20:47:12 +00:00
// rpath = round_corners(path3d, joint=rounding, k=1, method="smooth", closed=false);
2019-07-13 00:17:36 +00:00
// path_sweep( regular_ngon(n=36, or=.1), rpath);
2020-05-21 20:47:12 +00:00
function round_corners ( path , method = "circle" , radius , cut , joint , k , closed = true , verbose = false ) =
assert ( in_list ( method , [ "circle" , "smooth" , "chamfer" ] ) , "method must be one of \"circle\", \"smooth\" or \"chamfer\"" )
let (
default_k = 0.5 ,
size = one_defined ( [ radius , cut , joint ] , [ "radius" , "cut" , "joint" ] ) ,
path = is_region ( path ) ?
assert ( len ( path ) = = 1 , "Region supplied as path does not have exactly one component" )
path [ 0 ] : path ,
size_ok = is_num ( size ) || len ( size ) = = len ( path ) || ( ! closed && len ( size ) = = len ( path ) - 2 ) ,
k_ok = is_undef ( k ) || ( method = = "smooth" && ( is_num ( k ) || len ( k ) = = len ( path ) || ( ! closed && len ( k ) = = len ( path ) - 2 ) ) ) ,
measure = is_def ( radius ) ? "radius" :
is_def ( cut ) ? "cut" : "joint"
)
assert ( is_path ( path , [ 2 , 3 ] ) , "input path must be a 2d or 3d path" )
assert ( len ( path ) > 2 , str ( "Path has length " , len ( path ) , ". Length must be 3 or more." ) )
assert ( size_ok , str ( "Input " , measure , " must be a number or list with length " , len ( path ) , closed ? "" : str ( " or " , len ( path ) - 2 ) ) )
assert ( k_ok , method = = "smooth" ? str ( "Input k must be a number or list with length " , len ( path ) , closed ? "" : str ( " or " , len ( path ) - 2 ) ) :
"Input k is only allowed with method=\"smooth\"" )
assert ( method = = "circle" || measure ! = "radius" , "radius parameter allowed only with method=\"circle\"" )
assert ( method ! = "circle" || measure ! = "joint" , "joint parameter not allowed with method=\"circle\"" )
let (
parm = is_num ( size ) ? repeat ( size , len ( path ) ) :
len ( size ) < len ( path ) ? [ 0 , each size , 0 ] :
size ,
k = is_undef ( k ) ? repeat ( default_k , len ( path ) ) :
is_num ( k ) ? repeat ( k , len ( path ) ) :
len ( k ) < len ( path ) ? [ 0 , each k , 0 ] :
k ,
badparm = [ for ( i = idx ( parm ) ) if ( parm [ i ] < 0 ) i ] ,
badk = [ for ( i = idx ( k ) ) if ( k [ i ] < 0 || k [ i ] > 1 ) i ]
)
assert ( is_vector ( parm ) && badparm = = [ ] , str ( measure , " must be nonnegative" ) )
assert ( is_vector ( k ) && badk = = [ ] , "k parameter must be in the interval [0,1]" )
let (
// dk is a list of parameters, where distance is the joint length to move away from the corner
// "smooth" method: [distance, curvature]
// "circle" method: [distance, radius]
// "chamfer" method: [distance]
dk = [
for ( i = [ 0 : 1 : len ( path ) - 1 ] )
let (
angle = vector_angle ( select ( path , i - 1 , i + 1 ) ) / 2
)
( ! closed && ( i = = 0 || i = = len ( path ) - 1 ) ) ? [ 0 ] : // Force zeros at ends for non-closed
( method = = "chamfer" && measure = = "joint" ) ? [ parm [ i ] ] :
( method = = "chamfer" && measure = = "cut" ) ? [ parm [ i ] / cos ( angle ) ] :
( method = = "smooth" && measure = = "joint" ) ? [ parm [ i ] , k [ i ] ] :
( method = = "smooth" && measure = = "cut" ) ? [ 8 * parm [ i ] / cos ( angle ) / ( 1 + 4 * k [ i ] ) , k [ i ] ] :
( method = = "circle" && measure = = "radius" ) ? [ parm [ i ] / tan ( angle ) , parm [ i ] ] :
let ( circ_radius = parm [ i ] / ( 1 / sin ( angle ) - 1 ) )
[ circ_radius / tan ( angle ) , circ_radius ] ,
] ,
lengths = [ for ( i = [ 0 : 1 : len ( path ) ] ) norm ( select ( path , i ) - select ( path , i - 1 ) ) ] ,
scalefactors = [
for ( i = [ 0 : 1 : len ( path ) - 1 ] )
min (
lengths [ i ] / sum ( subindex ( select ( dk , i - 1 , i ) , 0 ) ) ,
lengths [ i + 1 ] / sum ( subindex ( select ( dk , i , i + 1 ) , 0 ) )
)
] ,
dummy = verbose ? echo ( "Roundover scale factors:" , scalefactors ) : 0
)
assert ( min ( scalefactors ) >= 1 , "Roundovers are too big for the path" )
[
for ( i = [ 0 : 1 : len ( path ) - 1 ] ) each
( dk [ i ] [ 0 ] = = 0 ) ? [ path [ i ] ] :
( method = = "smooth" ) ? _bezcorner ( select ( path , i - 1 , i + 1 ) , dk [ i ] ) :
( method = = "chamfer" ) ? _chamfcorner ( select ( path , i - 1 , i + 1 ) , dk [ i ] ) :
_circlecorner ( select ( path , i - 1 , i + 1 ) , dk [ i ] )
] ;
2019-07-13 00:17:36 +00:00
// Computes the continuous curvature control points for a corner when given as
// input three points in a list defining the corner. The points must be
// equidistant from each other to produce the continuous curvature result.
// The output control points will include the 3 input points plus two
2020-05-20 04:56:09 +00:00
// interpolated points.
2019-07-13 00:17:36 +00:00
//
// k is the curvature parameter, ranging from 0 for very slow transition
// up to 1 for a sharp transition that doesn't have continuous curvature any more
2019-08-10 06:57:19 +00:00
function _smooth_bez_fill ( points , k ) = [
2020-05-21 20:47:12 +00:00
points [ 0 ] ,
lerp ( points [ 1 ] , points [ 0 ] , k ) ,
points [ 1 ] ,
lerp ( points [ 1 ] , points [ 2 ] , k ) ,
points [ 2 ] ,
2019-08-10 06:57:19 +00:00
] ;
2019-07-13 00:17:36 +00:00
// Computes the points of a continuous curvature roundover given as input
// the list of 3 points defining the corner and a parameter specification
//
// If parm is a scalar then it is treated as the curvature and the control
// points are calculated using _smooth_bez_fill. Otherwise, parm is assumed
// to be a pair [d,k] where d is the length of the curve. The length is
// calculated from the input point list and the control point list will not
// necessarily include points[0] or points[2] on its output.
//
// The number of points output is $fn if it is set. Otherwise $fs is used
2020-05-20 04:56:09 +00:00
// to calculate the point count.
2019-07-13 00:17:36 +00:00
function _bezcorner ( points , parm ) =
2020-05-21 20:47:12 +00:00
let (
P = is_list ( parm ) ?
let (
d = parm [ 0 ] ,
k = parm [ 1 ] ,
prev = unit ( points [ 0 ] - points [ 1 ] ) ,
next = unit ( points [ 2 ] - points [ 1 ] )
) [
points [ 1 ] + d * prev ,
points [ 1 ] + k * d * prev ,
points [ 1 ] ,
points [ 1 ] + k * d * next ,
points [ 1 ] + d * next
] : _smooth_bez_fill ( points , parm ) ,
N = max ( 3 , $fn > 0 ? $fn : ceil ( bezier_segment_length ( P ) / $fs ) )
)
bezier_curve ( P , N ) ;
2019-07-13 00:17:36 +00:00
2020-01-09 23:52:08 +00:00
function _chamfcorner ( points , parm ) =
let (
d = parm [ 0 ] ,
2020-05-21 20:47:12 +00:00
prev = unit ( points [ 0 ] - points [ 1 ] ) ,
next = unit ( points [ 2 ] - points [ 1 ] )
2020-01-09 23:52:08 +00:00
)
[ points [ 1 ] + prev * d , points [ 1 ] + next * d ] ;
2019-07-13 00:17:36 +00:00
function _circlecorner ( points , parm ) =
2020-05-21 20:47:12 +00:00
let (
angle = vector_angle ( points ) / 2 ,
d = parm [ 0 ] ,
r = parm [ 1 ] ,
prev = unit ( points [ 0 ] - points [ 1 ] ) ,
next = unit ( points [ 2 ] - points [ 1 ] ) ,
center = r / sin ( angle ) * unit ( prev + next ) + points [ 1 ] ,
start = points [ 1 ] + prev * d ,
end = points [ 1 ] + next * d
)
arc ( max ( 3 , angle / 180 * segs ( norm ( start - center ) ) ) , cp = center , points = [ start , end ] ) ;
2019-07-13 00:17:36 +00:00
2020-01-23 00:30:28 +00:00
// Used by offset_sweep and convex_offset_extrude:
// Produce edge profile curve from the edge specification
// z_dir is the direction multiplier (1 to build up, -1 to build down)
function _rounding_offsets ( edgespec , z_dir = 1 ) =
2020-05-20 04:56:09 +00:00
let (
2020-05-21 20:47:12 +00:00
edgetype = struct_val ( edgespec , "type" ) ,
extra = struct_val ( edgespec , "extra" ) ,
N = struct_val ( edgespec , "steps" ) ,
r = struct_val ( edgespec , "r" ) ,
cut = struct_val ( edgespec , "cut" ) ,
k = struct_val ( edgespec , "k" ) ,
radius = in_list ( edgetype , [ "circle" , "teardrop" ] ) ?
first_defined ( [ cut / ( sqrt ( 2 ) - 1 ) , r ] ) :
edgetype = = "chamfer" ? first_defined ( [ sqrt ( 2 ) * cut , r ] ) : undef ,
chamf_angle = struct_val ( edgespec , "angle" ) ,
cheight = struct_val ( edgespec , "chamfer_height" ) ,
cwidth = struct_val ( edgespec , "chamfer_width" ) ,
chamf_width = first_defined ( [ cut / cos ( chamf_angle ) , cwidth , cheight * tan ( chamf_angle ) ] ) ,
chamf_height = first_defined ( [ cut / sin ( chamf_angle ) , cheight , cwidth / tan ( chamf_angle ) ] ) ,
joint = first_defined ( [
struct_val ( edgespec , "joint" ) ,
16 * cut / sqrt ( 2 ) / ( 1 + 4 * k )
] ) ,
points = struct_val ( edgespec , "points" ) ,
argsOK = in_list ( edgetype , [ "circle" , "teardrop" ] ) ? is_def ( radius ) :
edgetype = = "chamfer" ? chamf_angle > 0 && chamf_angle < 90 && num_defined ( [ chamf_height , chamf_width ] ) = = 2 :
edgetype = = "smooth" ? num_defined ( [ k , joint ] ) = = 2 :
edgetype = = "profile" ? points [ 0 ] = = [ 0 , 0 ] :
false
)
assert ( argsOK , str ( "Invalid specification with type " , edgetype ) )
let (
offsets =
edgetype = = "profile" ? scale ( [ - 1 , z_dir ] , slice ( points , 1 , - 1 ) ) :
edgetype = = "chamfer" ? chamf_width = = 0 && chamf_height = = 0 ? [ ] : [ [ - chamf_width , z_dir * abs ( chamf_height ) ] ] :
edgetype = = "teardrop" ? (
radius = = 0 ? [ ] : concat (
[ for ( i = [ 1 : N ] ) [ radius * ( cos ( i * 45 / N ) - 1 ) , z_dir * abs ( radius ) * sin ( i * 45 / N ) ] ] ,
[ [ - 2 * radius * ( 1 - sqrt ( 2 ) / 2 ) , z_dir * abs ( radius ) ] ]
)
) :
edgetype = = "circle" ? radius = = 0 ? [ ] : [ for ( i = [ 1 : N ] ) [ radius * ( cos ( i * 90 / N ) - 1 ) , z_dir * abs ( radius ) * sin ( i * 90 / N ) ] ] :
/* smooth */ joint = = 0 ? [ ] :
select (
_bezcorner ( [ [ 0 , 0 ] , [ 0 , z_dir * abs ( joint ) ] , [ - joint , z_dir * abs ( joint ) ] ] , k , $fn = N + 2 ) ,
1 , - 1
)
)
quant ( extra > 0 ? concat ( offsets , [ select ( offsets , - 1 ) + [ 0 , z_dir * extra ] ] ) : offsets , 1 / 1024 ) ;
2020-01-23 00:30:28 +00:00
2020-03-05 01:24:00 +00:00
// Function: smooth_path()
// Usage:
2020-03-05 22:05:23 +00:00
// smooth_path(path, [tangents], [k], [splinesteps], [closed]
2020-03-05 01:24:00 +00:00
// Description:
// Smooths the input path using a cubic spline. Every segment of the path will be replaced by a cubic curve
// with `splinesteps` points. The cubic interpolation will pass through every input point on the path
// and will match the tangents at every point. If you do not specify tangents they will be computed using
2020-03-05 22:05:23 +00:00
// deriv(). See also path_to_bezier().
//
// Note that the magnitude of the tangents affects the result. If you increase it you will get a blunter
// corner with a larger radius of curvature. Decreasing it will produce a sharp corner. You can specify
// the curvature factor `k` to adjust the curvature. It can be a scalar or a vector the same length as
// the path and is used to scale the tangent vectors. Negative values of k create loops at the corners,
// so they are not allowed. Sufficiently large k values will also produce loops.
2020-03-05 01:24:00 +00:00
// Arguments:
// path = path to smooth
// tangents = tangent vectors of the path
// splinesteps = number of points to insert between the path points. Default: 10
2020-03-05 22:05:23 +00:00
// k = curvature parameter, a scalar or vector to adjust curvature at each point
2020-03-05 01:24:00 +00:00
// closed = set to true for a closed path. Default: false
// Example(2D): Original path in green, smoothed path in yellow:
// color("green")stroke(square(4), width=0.1);
// stroke(smooth_path(square(4)), width=0.1);
// Example(2D): Closing the path changes the end tangents
// polygon(smooth_path(square(4), closed=true));
2020-03-05 04:22:39 +00:00
// Example(2D): A more interesting shape:
// path = [[0,0], [4,0], [7,14], [-3,12]];
// polygon(smooth_path(path,closed=true));
2020-03-08 00:36:26 +00:00
// Example(2D): Scaling the tangent data using the curvature parameter k can decrease or increase the amount of smoothing. Note this is the same as just multiplying the deriv(square(4)) by k.
2020-03-05 22:05:23 +00:00
// polygon(smooth_path(square(4), k=0.5,closed=true));
2020-03-05 04:22:39 +00:00
// Example(2D): Or you can specify your own tangent values to alter the shape of the curve
// polygon(smooth_path(square(4),tangents=1.25*[[-2,-1], [-2,1], [1,2], [2,-1]],closed=true));
2020-03-05 01:24:00 +00:00
// Example(FlatSpin): Works on 3d paths as well
// path = [[0,0,0],[3,3,2],[6,0,1],[9,9,0]];
// trace_polyline(smooth_path(path),size=.3);
2020-05-20 04:56:09 +00:00
// Example(2D): The curve passes through all the points, but features some unexpected wiggles. These occur because the curvature is too low to change fast enough.
2020-03-05 22:05:23 +00:00
// path = [[0,0], [0,3], [.5,2.8], [1,2.2], [1,0]];
// polygon(smooth_path(path));
2020-03-25 01:31:22 +00:00
// color("red") move_copies(path)circle(r=.1,$fn=16);
2020-05-20 04:56:09 +00:00
// Example(2D): Using the k parameter is one way to fix this problem. By allowing sharper curvature (k<1) at the two points next to the problematic point we can achieve a smoother result. The other fix is to move your points.
2020-03-05 22:05:23 +00:00
// path = [[0,0], [0,3], [.5,2.8], [1,2.2], [1,0]];
// polygon(smooth_path(path,k=[1,.5,1,.5,1]));
2020-03-25 01:31:22 +00:00
// color("red") move_copies(path)circle(r=.1,$fn=16);
2020-03-05 22:05:23 +00:00
function smooth_path ( path , tangents , k , splinesteps = 10 , closed = false ) =
let (
bez = path_to_bezier ( path , tangents , k = k , closed = closed )
2020-03-05 01:24:00 +00:00
)
bezier_polyline ( bez , splinesteps = splinesteps ) ;
2020-01-23 00:30:28 +00:00
2020-03-05 22:05:23 +00:00
2019-09-02 22:15:24 +00:00
// Module: offset_sweep()
2019-07-13 00:17:36 +00:00
//
// Description:
2020-05-20 04:56:09 +00:00
// Takes a 2d path as input and extrudes it upwards and/or downward. Each layer in the extrusion is produced using `offset()` to expand or shrink the previous layer.
// You can specify a sequence of offsets values, or you can use several built-in offset profiles that are designed to provide end treatments such as roundovers.
2019-09-02 22:15:24 +00:00
// The path is shifted by `offset()` multiple times in sequence
// to produce the final shape (not multiple shifts from one parent), so coarse definition of the input path will degrade
2019-07-23 02:40:49 +00:00
// from the successive shifts. If the result seems rough or strange try increasing the number of points you use for
// your input. If you get unexpected corners in your result, decrease `offset_maxstep` or decrease `steps`. You must
// choose `offset_maxstep` small enough so that the first offset step rounds, otherwise you will probably not get any
// rounding, even if you have selected rounding. This may require a much smaller value than you expect. However, be
// aware that large numbers of points (especially when check_valid is true) can lead to lengthy run times. If your
// shape doesn't develop corners you may be able to save a lot of time by setting `check_valid=false`. Be aware that
// disabling the validity check when it is needed can generate invalid polyhedra that will produce CGAL errors upon
2019-09-02 22:15:24 +00:00
// rendering. Such validity errors will also occur if you specify a self-intersecting shape.
2020-05-20 04:56:09 +00:00
// The offset profile is quantized to 1/1024 steps to avoid failures in offset() that can occur with very tiny offsets.
2019-07-13 01:44:11 +00:00
//
2020-05-20 04:56:09 +00:00
// The build-in profiles are: circular rounding, teardrop rounding, chamfer, continuous curvature rounding, and chamfer.
2019-09-02 22:15:24 +00:00
// Also note that when a rounding radius is negative the rounding will flare outwards. The easieast way to specify
// the profile is by using the profile helper functions. These functions take profile parameters, as well as some
// general settings and translate them into a profile specification, with error checking on your input. The description below
// describes the helper functions and the parameters specific to each function. Below that is a description of the generic
2020-05-20 04:56:09 +00:00
// settings that you can optionally use with all of the helper functions.
2019-07-13 01:44:11 +00:00
//
2019-09-02 22:15:24 +00:00
// - profile: os_profile(points)
2020-05-20 04:56:09 +00:00
// Define the offset profile with a list of points. The first point must be [0,0] and the roundover should rise in the positive y direction, with positive x values for inward motion (standard roundover) and negative x values for flaring outward. If the y value ever decreases then you might create a self-intersecting polyhedron, which is invalid. Such invalid polyhedra will create cryptic assertion errors when you render your model and it is your responsibility to avoid creating them. Note that the starting point of the profile is the center of the extrusion. If you use a profile as the top it will rise upwards. If you use it as the bottom it will be inverted, and will go downward.
// - circle: os_circle(r|cut). Define circular rounding either by specifying the radius or cut distance.
2019-09-02 22:15:24 +00:00
// - smooth: os_smooth(cut|joint). Define continuous curvature rounding, with `cut` and `joint` as for round_corners.
// - teardrop: os_teardrop(r|cut). Rounding using a 1/8 circle that then changes to a 45 degree chamfer. The chamfer is at the end, and enables the object to be 3d printed without support. The radius gives the radius of the circular part.
// - chamfer: os_chamfer([height], [width], [cut], [angle]). Chamfer the edge at desired angle or with desired height and width. You can specify height and width together and the angle will be ignored, or specify just one of height and width and the angle is used to determine the shape. Alternatively, specify "cut" along with angle to specify the cut back distance of the chamfer.
2019-09-02 22:18:49 +00:00
//
// The general settings that you can use with all of the helper functions are mostly used to control how offset_sweep() calls the offset() function.
2019-09-02 22:15:24 +00:00
// - extra: Add an extra vertical step of the specified height, to be used for intersections or differences. This extra step will extend the resulting object beyond the height you specify. Default: 0
// - check_valid: passed to offset(). Default: true
// - quality: passed to offset(). Default: 1
// - steps: Number of vertical steps to use for the profile. (Not used by os_profile). Default: 16
// - offset_maxstep: The maxstep distance for offset() calls; controls the horizontal step density. Set smaller if you don't get the expected rounding. Default: 1
2020-01-25 05:40:03 +00:00
// - offset: Select "round" (r=) or "delta" (delta=) offset types for offset. You can also choose "chamfer" but this leads to exponential growth in the number of vertices with the steps parameter. Default: "round"
2019-09-02 22:18:49 +00:00
//
2020-05-20 04:56:09 +00:00
// Many of the arguments are described as setting "default" values because they establish settings which may be overridden by
// the top and bottom profile specifications.
2019-07-18 23:21:08 +00:00
//
2020-05-20 04:56:09 +00:00
// You will generally want to use the above helper functions to generate the profiles.
2019-09-05 01:23:33 +00:00
// The profile specification is a list of pairs of keywords and values, e.g. ["r",12, type, "circle"]. The keywords are
// - "type" - type of rounding to apply, one of "circle", "teardrop", "chamfer", "smooth", or "profile" (Default: "circle")
// - "r" - the radius of the roundover, which may be zero for no roundover, or negative to round or flare outward. Default: 0
// - "cut" - the cut distance for the roundover or chamfer, which may be negative for flares
// - "chamfer_width" - the width of a chamfer
// - "chamfer_height" - the height of a chamfer
// - "angle" - the chamfer angle, measured from the vertical (so zero is vertical, 90 is horizontal). Default: 45
// - "joint" - the joint distance for a "smooth" roundover
// - "k" - the curvature smoothness parameter for "smooth" roundovers, a value in [0,1]. Default: 0.75
// - "points" - point list for use with the "profile" type
2020-05-20 04:56:09 +00:00
// - "extra" - extra height added for unions/differences. This makes the shape taller than the requested height. (Default: 0)
2019-09-05 01:23:33 +00:00
// - "check_valid" - passed to offset. Default: true.
// - "quality" - passed to offset. Default: 1.
// - "steps" - number of vertical steps to use for the roundover. Default: 16.
// - "offset_maxstep" - maxstep distance for offset() calls; controls the horizontal step density. Set smaller if you don't get expected rounding. Default: 1
2020-01-25 05:40:03 +00:00
// - "offset" - select "round" (r=), "delta" (delta=), or "chamfer" offset type for offset. Default: "round"
2019-09-05 01:23:33 +00:00
//
2020-01-25 05:40:03 +00:00
// Note that if you set the "offset" parameter to "chamfer" then every exterior corner turns from one vertex into two vertices with
// each offset operation. Since the offsets are done one after another, each on the output of the previous one, this leads to
// exponential growth in the number of vertices. This can lead to long run times or yield models that
// run out of recursion depth and give a cryptic error. Furthermore, the generated vertices are distributed non-uniformly. Generally you
// will get a similar or better looking model with fewer vertices using "round" instead of
// "chamfer". Use the "chamfer" style offset only in cases where the number of steps is very small or just one (such as when using
2020-05-20 04:56:09 +00:00
// the `os_chamfer` profile type).
2020-01-25 05:40:03 +00:00
//
2019-07-13 00:17:36 +00:00
// Arguments:
// path = 2d path (list of points) to extrude
2020-05-20 04:56:09 +00:00
// height / l / h = total height (including rounded portions, but not extra sections) of the output. Default: combined height of top and bottom end treatments.
// top = rounding spec for the top end.
// bottom = rounding spec for the bottom end
2019-07-13 05:27:32 +00:00
// offset = default offset, `"round"` or `"delta"`. Default: `"round"`
// steps = default step count. Default: 16
// quality = default quality. Default: 1
// check_valid = default check_valid. Default: true.
// offset_maxstep = default maxstep value to pass to offset. Default: 1
// extra = default extra height. Default: 0
// cut = default cut value.
2019-08-29 01:15:41 +00:00
// chamfer_width = default width value for chamfers.
// chamfer_height = default height value for chamfers.
2019-07-13 05:27:32 +00:00
// angle = default angle for chamfers. Default: 45
// joint = default joint value for smooth roundover.
// k = default curvature parameter value for "smooth" roundover
// convexity = convexity setting for use with polyhedron. Default: 10
2019-09-05 01:23:33 +00:00
//
2019-07-13 00:17:36 +00:00
// Example: Rounding a star shaped prism with postive radius values
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-09-02 22:15:24 +00:00
// offset_sweep(rounded_star, height=20, bottom=os_circle(r=4), top=os_circle(r=1), steps=15);
2019-07-13 00:17:36 +00:00
// Example: Rounding a star shaped prism with negative radius values
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-09-02 22:15:24 +00:00
// offset_sweep(rounded_star, height=20, bottom=os_circle(r=-4), top=os_circle(r=-1), steps=15);
2020-05-20 04:56:09 +00:00
// Example: Unexpected corners in the result even with `offset="round"` (the default), even with offset_maxstep set small.
2019-07-23 02:40:49 +00:00
// triangle = [[0,0],[10,0],[5,10]];
2019-09-02 22:15:24 +00:00
// offset_sweep(triangle, height=6, bottom = os_circle(r=-2),steps=16,offset_maxstep=0.25);
2019-07-23 02:40:49 +00:00
// Example: Can improve the result by decreasing the number of steps
// triangle = [[0,0],[10,0],[5,10]];
2019-09-02 22:15:24 +00:00
// offset_sweep(triangle, height=6, bottom = os_circle(r=-2),steps=4,offset_maxstep=0.25);
2019-07-23 02:40:49 +00:00
// Example: Or by decreasing `offset_maxstep`
// triangle = [[0,0],[10,0],[5,10]];
2019-09-02 22:15:24 +00:00
// offset_sweep(triangle, height=6, bottom = os_circle(r=-2),steps=16,offset_maxstep=0.01);
2020-05-20 04:56:09 +00:00
// Example: Here is the star chamfered at the top with a teardrop rounding at the bottom. Check out the rounded corners on the chamfer. Note that a very small value of `offset_maxstep` is needed to keep these round. Observe how the rounded star points vanish at the bottom in the teardrop: the number of vertices does not remain constant from layer to layer.
2019-07-13 00:17:36 +00:00
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-09-02 22:15:24 +00:00
// offset_sweep(rounded_star, height=20, bottom=os_teardrop(r=4), top=os_chamfer(width=4,offset_maxstep=.1));
2020-05-20 04:56:09 +00:00
// Example: We round a cube using the continous curvature rounding profile. But note that the corners are not smooth because the curved square collapses into a square with corners. When a collapse like this occurs, we cannot turn `check_valid` off.
2020-05-21 20:47:12 +00:00
// square = square(1);
// rsquare = round_corners(square, method="smooth", cut=0.1, k=0.7, $fn=36);
2019-09-02 22:15:24 +00:00
// end_spec = os_smooth(cut=0.1, k=0.7, steps=22);
// offset_sweep(rsquare, height=1, bottom=end_spec, top=end_spec);
2019-07-13 00:17:36 +00:00
// Example: A nice rounded box, with a teardrop base and circular rounded interior and top
2020-05-21 20:47:12 +00:00
// box = square([255,50]);
// rbox = round_corners(box, method="smooth", cut=4, $fn=12);
2019-07-13 00:17:36 +00:00
// thickness = 2;
// difference(){
2019-09-02 22:15:24 +00:00
// offset_sweep(rbox, height=50, check_valid=false, steps=22, bottom=os_teardrop(r=2), top=os_circle(r=1));
2019-07-13 00:17:36 +00:00
// up(thickness)
2019-09-02 22:15:24 +00:00
// offset_sweep(offset(rbox, r=-thickness, closed=true,check_valid=false),
// height=48, steps=22, check_valid=false, bottom=os_circle(r=4), top=os_circle(r=-1,extra=1));
2019-07-13 00:17:36 +00:00
// }
2020-05-20 04:56:09 +00:00
// Example: This box is much thicker, and cut in half to show the profiles. Note also that we can turn `check_valid` off for the outside and for the top inside, but not for the bottom inside. This example shows use of the direct keyword syntax without the helper functions.
2020-05-21 20:47:12 +00:00
// smallbox = square([75,50]);
// roundbox = round_corners(smallbox, method="smooth", cut=4, $fn=12);
2019-07-13 00:17:36 +00:00
// thickness=4;
// height=50;
2019-07-18 23:21:08 +00:00
// back_half(y=25, s=200)
2019-07-13 00:17:36 +00:00
// difference(){
2019-09-02 22:15:24 +00:00
// offset_sweep(roundbox, height=height, bottom=["r",10,"type","teardrop"], top=["r",2], steps = 22, check_valid=false);
2019-07-13 00:17:36 +00:00
// up(thickness)
2019-09-02 22:15:24 +00:00
// offset_sweep(offset(roundbox, r=-thickness, closed=true),
2019-07-13 00:17:36 +00:00
// height=height-thickness, steps=22,
// bottom=["r",6],
2020-05-20 04:56:09 +00:00
// top=["type","chamfer","angle",30,"chamfer_height",-3,"extra",1,"check_valid",false]);
2019-07-13 00:17:36 +00:00
// }
2019-07-18 23:21:08 +00:00
// Example: A box with multiple sections and rounded dividers
// thickness = 2;
2020-05-21 20:47:12 +00:00
// box = square([255,50]);
2019-07-18 23:21:08 +00:00
// cutpoints = [0, 125, 190, 255];
2020-05-21 20:47:12 +00:00
// rbox = round_corners(box, method="smooth", cut=4, $fn=12);
2019-07-18 23:21:08 +00:00
// back_half(y=25, s=700)
// difference(){
2019-09-02 22:15:24 +00:00
// offset_sweep(rbox, height=50, check_valid=false, steps=22, bottom=os_teardrop(r=2), top=os_circle(r=1));
2019-07-18 23:21:08 +00:00
// up(thickness)
// for(i=[0:2]){
// ofs = i==1 ? 2 : 0;
// hole = round_corners([[cutpoints[i]-ofs,0], [cutpoints[i]-ofs,50], [cutpoints[i+1]+ofs, 50], [cutpoints[i+1]+ofs,0]],
2020-05-21 20:47:12 +00:00
// method="smooth", cut=4, $fn=36);
2019-09-02 22:15:24 +00:00
// offset_sweep(offset(hole, r=-thickness, closed=true,check_valid=false),
// height=48, steps=22, check_valid=false, bottom=os_circle(r=4), top=os_circle(r=-1,extra=1));
2019-07-18 23:21:08 +00:00
// }
// }
2019-07-13 00:17:36 +00:00
// Example: Star shaped box
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-07-13 00:17:36 +00:00
// thickness = 2;
// ht=20;
// difference(){
2019-09-02 22:15:24 +00:00
// offset_sweep(rounded_star, height=ht, bottom=["r",4], top=["r",1], steps=15);
2019-07-13 00:17:36 +00:00
// up(thickness)
2019-09-02 22:15:24 +00:00
// offset_sweep(offset(rounded_star,r=-thickness,closed=true),
2019-07-13 00:17:36 +00:00
// height=ht-thickness, check_valid=false,
2019-09-02 22:15:24 +00:00
// bottom=os_circle(r=7), top=os_circle(r=-1, extra=1));
2019-07-13 00:17:36 +00:00
// }
2020-05-20 04:56:09 +00:00
// Example: A profile defined by an arbitrary sequence of points.
2019-07-13 00:17:36 +00:00
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-09-02 22:15:24 +00:00
// profile = os_profile(points=[[0,0],[.3,.1],[.6,.3],[.9,.9], [1.2, 2.7],[.8,2.7],[.8,3]]);
// offset_sweep(reverse(rounded_star), height=20, top=profile, bottom=profile);
// Example: Parabolic rounding
2019-07-13 00:17:36 +00:00
// star = star(5, r=22, ir=13);
2020-05-21 20:47:12 +00:00
// rounded_star = round_corners(star, cut=flatten(repeat([.5,0],5)), $fn=48);
2019-09-02 22:15:24 +00:00
// offset_sweep(rounded_star, height=20, top=os_profile(points=[for(r=[0:.1:2])[sqr(r),r]]),
// bottom=os_profile(points=[for(r=[0:.2:5])[-sqrt(r),r]]));
2020-05-20 04:56:09 +00:00
// Example: This example uses a sine wave offset profile. Note that because the offsets occur sequentially and the path grows incrementally the offset needs a very fine resolution to produce the proper result. Note that we give no specification for the bottom, so it is straight.
2019-07-13 00:17:36 +00:00
// sq = [[0,0],[20,0],[20,20],[0,20]];
2019-09-02 22:15:24 +00:00
// sinwave = os_profile(points=[for(theta=[0:5:720]) [4*sin(theta), theta/700*15]]);
// offset_sweep(sq, height=20, top=sinwave, offset_maxstep=.05);
2019-07-13 00:17:36 +00:00
// Example: The same as the previous example but `offset="delta"`
// sq = [[0,0],[20,0],[20,20],[0,20]];
2019-09-02 22:15:24 +00:00
// sinwave = os_profile(points=[for(theta=[0:5:720]) [4*sin(theta), theta/700*15]]);
// offset_sweep(sq, height=20, top=sinwave, offset_maxstep=.05, offset="delta");
// Example: a box with a flared top. A nice roundover on the top requires a profile edge, but we can use "extra" to create a small chamfer.
2020-05-21 20:47:12 +00:00
// rhex = round_corners(hexagon(side=10), method="smooth", joint=2, $fs=0.2);
2019-07-13 05:27:32 +00:00
// back_half()
2019-07-13 00:17:36 +00:00
// difference(){
2019-09-02 22:15:24 +00:00
// offset_sweep(rhex, height=10, bottom=os_teardrop(r=2), top=os_teardrop(r=-4, extra=0.2));
2019-07-13 00:17:36 +00:00
// up(1)
2020-04-22 02:20:25 +00:00
// offset_sweep(offset(rhex,r=-1), height=9.5, bottom=os_circle(r=2), top=os_teardrop(r=-4));
2019-07-13 00:17:36 +00:00
// }
2019-09-02 22:15:24 +00:00
module offset_sweep (
2020-05-21 20:47:12 +00:00
path , height , h , l ,
top = [ ] , bottom = [ ] ,
offset = "round" , r = 0 , steps = 16 ,
quality = 1 , check_valid = true ,
offset_maxstep = 1 , extra = 0 ,
cut = undef , chamfer_width = undef , chamfer_height = undef ,
joint = undef , k = 0.75 , angle = 45 ,
convexity = 10
2019-08-10 06:57:19 +00:00
) {
2020-05-21 20:47:12 +00:00
// This function does the actual work of repeatedly calling offset() and concatenating the resulting face and vertex lists to produce
// the inputs for the polyhedron module.
function make_polyhedron ( path , offsets , offset_type , flip_faces , quality , check_valid , maxstep , offsetind = 0 , vertexcount = 0 , vertices = [ ] , faces = [ ] ) =
offsetind = = len ( offsets ) ? (
let (
bottom = list_range ( n = len ( path ) , s = vertexcount ) ,
oriented_bottom = ! flip_faces ? bottom : reverse ( bottom )
) [ vertices , concat ( faces , [ oriented_bottom ] ) ]
) : (
let (
this_offset = offsetind = = 0 ? offsets [ 0 ] [ 0 ] : offsets [ offsetind ] [ 0 ] - offsets [ offsetind - 1 ] [ 0 ] ,
delta = offset_type = = "delta" || offset_type = = "chamfer" ? this_offset : undef ,
r = offset_type = = "round" ? this_offset : undef ,
2020-01-25 05:40:03 +00:00
do_chamfer = offset_type = = "chamfer"
2020-05-21 20:47:12 +00:00
)
assert ( num_defined ( [ r , delta ] ) = = 1 , "Must set `offset` to \"round\" or \"delta" )
let (
vertices_faces = offset (
path , r = r , delta = delta , chamfer = do_chamfer , closed = true ,
check_valid = check_valid , quality = quality ,
maxstep = maxstep , return_faces = true ,
firstface_index = vertexcount ,
flip_faces = flip_faces
)
)
make_polyhedron (
vertices_faces [ 0 ] , offsets , offset_type ,
flip_faces , quality , check_valid , maxstep ,
offsetind + 1 , vertexcount + len ( path ) ,
vertices = concat (
vertices ,
zip ( vertices_faces [ 0 ] , repeat ( offsets [ offsetind ] [ 1 ] , len ( vertices_faces [ 0 ] ) ) )
) ,
faces = concat ( faces , vertices_faces [ 1 ] )
)
) ;
argspec = [
[ "r" , r ] ,
[ "extra" , extra ] ,
[ "type" , "circle" ] ,
[ "check_valid" , check_valid ] ,
[ "quality" , quality ] ,
[ "offset_maxstep" , offset_maxstep ] ,
[ "steps" , steps ] ,
[ "offset" , offset ] ,
[ "chamfer_width" , chamfer_width ] ,
[ "chamfer_height" , chamfer_height ] ,
[ "angle" , angle ] ,
[ "cut" , cut ] ,
[ "joint" , joint ] ,
[ "k" , k ] ,
[ "points" , [ ] ] ,
] ;
path = check_and_fix_path ( path , [ 2 ] , closed = true ) ;
clockwise = polygon_is_clockwise ( path ) ;
top = struct_set ( argspec , top , grow = false ) ;
bottom = struct_set ( argspec , bottom , grow = false ) ;
// This code does not work. It hits the error in make_polyhedron from offset being wrong
// before this code executes. Had to move the test into make_polyhedron, which is ugly since it's in the loop
//offsetsok = in_list(struct_val(top, "offset"),["round","delta"]) &&
// in_list(struct_val(bottom, "offset"),["round","delta"]);
//assert(offsetsok,"Offsets must be one of \"round\" or \"delta\"");
offsets_bot = _rounding_offsets ( bottom , - 1 ) ;
offsets_top = _rounding_offsets ( top , 1 ) ;
2019-07-13 05:27:32 +00:00
2020-01-25 05:40:03 +00:00
if ( offset = = "chamfer" && ( len ( offsets_bot ) > 5 || len ( offsets_top ) > 5 ) ) {
echo ( "WARNING: You have selected offset=\"chamfer\", which leads to exponential growth in the vertex count and requested many layers. This can be slow or run out of recursion depth." ) ;
}
2020-05-21 20:47:12 +00:00
// "Extra" height enlarges the result beyond the requested height, so subtract it
bottom_height = len ( offsets_bot ) = = 0 ? 0 : abs ( select ( offsets_bot , - 1 ) [ 1 ] ) - struct_val ( bottom , "extra" ) ;
top_height = len ( offsets_top ) = = 0 ? 0 : abs ( select ( offsets_top , - 1 ) [ 1 ] ) - struct_val ( top , "extra" ) ;
2019-07-13 00:17:36 +00:00
2019-08-29 01:15:41 +00:00
height = get_height ( l = l , h = h , height = height , dflt = bottom_height + top_height ) ;
2020-05-21 20:47:12 +00:00
assert ( height >= 0 , "Height must be nonnegative" ) ;
middle = height - bottom_height - top_height ;
assert (
middle >= 0 , str (
"Specified end treatments (bottom height = " , bottom_height ,
" top_height = " , top_height , ") are too large for extrusion height (" , height , ")"
)
) ;
initial_vertices_bot = path3d ( path ) ;
vertices_faces_bot = make_polyhedron (
path , offsets_bot , struct_val ( bottom , "offset" ) , clockwise ,
struct_val ( bottom , "quality" ) ,
struct_val ( bottom , "check_valid" ) ,
struct_val ( bottom , "offset_maxstep" ) ,
vertices = initial_vertices_bot
) ;
top_start_ind = len ( vertices_faces_bot [ 0 ] ) ;
initial_vertices_top = zip ( path , repeat ( middle , len ( path ) ) ) ;
vertices_faces_top = make_polyhedron (
path , move ( p = offsets_top , [ 0 , middle ] ) ,
struct_val ( top , "offset" ) , ! clockwise ,
struct_val ( top , "quality" ) ,
struct_val ( top , "check_valid" ) ,
struct_val ( top , "offset_maxstep" ) ,
vertexcount = top_start_ind ,
vertices = initial_vertices_top
) ;
middle_faces = middle = = 0 ? [ ] : [
for ( i = [ 0 : len ( path ) - 1 ] ) let (
oneface = [ i , ( i + 1 ) % len ( path ) , top_start_ind + ( i + 1 ) % len ( path ) , top_start_ind + i ]
) ! clockwise ? reverse ( oneface ) : oneface
] ;
up ( bottom_height ) {
polyhedron (
concat ( vertices_faces_bot [ 0 ] , vertices_faces_top [ 0 ] ) ,
faces = concat ( vertices_faces_bot [ 1 ] , vertices_faces_top [ 1 ] , middle_faces ) ,
convexity = convexity
) ;
}
2019-07-13 00:17:36 +00:00
}
2019-09-02 22:15:24 +00:00
function os_circle ( r , cut , extra , check_valid , quality , steps , offset_maxstep , offset ) =
2020-05-21 20:47:12 +00:00
assert ( num_defined ( [ r , cut ] ) = = 1 , "Must define exactly one of `r` and `cut`" )
_remove_undefined_vals ( [
"type" , "circle" ,
"r" , r ,
"cut" , cut ,
"extra" , extra ,
"check_valid" , check_valid ,
"quality" , quality ,
"steps" , steps ,
"offset_maxstep" , offset_maxstep ,
"offset" , offset
] ) ;
2019-07-13 00:17:36 +00:00
2019-09-02 22:15:24 +00:00
function os_teardrop ( r , cut , extra , check_valid , quality , steps , offset_maxstep , offset ) =
2020-05-21 20:47:12 +00:00
assert ( num_defined ( [ r , cut ] ) = = 1 , "Must define exactly one of `r` and `cut`" )
_remove_undefined_vals ( [
"type" , "teardrop" ,
"r" , r ,
"cut" , cut ,
"extra" , extra ,
"check_valid" , check_valid ,
"quality" , quality ,
"steps" , steps ,
"offset_maxstep" , offset_maxstep ,
"offset" , offset
] ) ;
2019-07-13 00:17:36 +00:00
2019-09-02 22:15:24 +00:00
function os_chamfer ( height , width , cut , angle , extra , check_valid , quality , steps , offset_maxstep , offset ) =
2020-05-21 20:47:12 +00:00
let ( ok = ( is_def ( cut ) && num_defined ( [ height , width ] ) = = 0 ) || num_defined ( [ height , width ] ) > 0 )
assert ( ok , "Must define `cut`, or one or both of `width` and `height`" )
_remove_undefined_vals ( [
"type" , "chamfer" ,
"chamfer_width" , width ,
"chamfer_height" , height ,
"cut" , cut ,
"angle" , angle ,
"extra" , extra ,
"check_valid" , check_valid ,
"quality" , quality ,
"steps" , steps ,
"offset_maxstep" , offset_maxstep ,
"offset" , offset
] ) ;
2019-07-13 00:17:36 +00:00
2019-09-02 22:15:24 +00:00
function os_smooth ( cut , joint , k , extra , check_valid , quality , steps , offset_maxstep , offset ) =
2020-05-21 20:47:12 +00:00
assert ( num_defined ( [ joint , cut ] ) = = 1 , "Must define exactly one of `joint` and `cut`" )
_remove_undefined_vals ( [
"type" , "smooth" ,
"joint" , joint ,
"k" , k ,
"cut" , cut ,
"extra" , extra ,
"check_valid" , check_valid ,
"quality" , quality ,
"steps" , steps ,
"offset_maxstep" , offset_maxstep ,
"offset" , offset
] ) ;
2019-07-13 00:17:36 +00:00
2019-09-02 22:15:24 +00:00
function os_profile ( points , extra , check_valid , quality , offset_maxstep , offset ) =
2020-05-21 20:47:12 +00:00
assert ( is_path ( points ) , "Profile point list is not valid" )
_remove_undefined_vals ( [
"type" , "profile" ,
"points" , points ,
"extra" , extra ,
"check_valid" , check_valid ,
"quality" , quality ,
"offset_maxstep" , offset_maxstep ,
"offset" , offset
] ) ;
2019-08-10 06:57:19 +00:00
2019-07-13 00:17:36 +00:00
2020-01-23 00:30:28 +00:00
// Module: convex_offset_extrude()
//
// Description:
// Extrudes 2d children with layers formed from the convex hull of the offset of each child according to a sequence of offset values.
// Like `offset_sweep` this module can use built-in offset profiles to provide treatments such as roundovers or chamfers but unlike `offset_sweep()` it
// operates on 2d children rather than a point list. Each offset is computed using
// the native `offset()` module from the input geometry. If your geometry has internal holes or is too small for the specified offset then you may get
// unexpected results.
//
2020-05-20 04:56:09 +00:00
// The build-in profiles are: circular rounding, teardrop rounding, chamfer, continuous curvature rounding, and chamfer.
2020-01-23 00:30:28 +00:00
// Also note that when a rounding radius is negative the rounding will flare outwards. The easieast way to specify
// the profile is by using the profile helper functions. These functions take profile parameters, as well as some
// general settings and translate them into a profile specification, with error checking on your input. The description below
// describes the helper functions and the parameters specific to each function. Below that is a description of the generic
// settings that you can optionally use with all of the helper functions.
//
// The final shape is created by combining convex hulls of small extrusions. The thickness of these small extrusions may result
// your model being slightly too long (if the curvature at the end is flaring outward), so if the exact length is very important
// you may need to intersect with a bounding cube. (Note that extra length can also be intentionally added with the `extra` argument.)
//
// - profile: os_profile(points)
2020-05-20 04:56:09 +00:00
// Define the offset profile with a list of points. The first point must be [0,0] and the roundover should rise in the positive y direction, with positive x values for inward motion (standard roundover) and negative x values for flaring outward. If the y value ever decreases then you might create a self-intersecting polyhedron, which is invalid. Such invalid polyhedra will create cryptic assertion errors when you render your model and it is your responsibility to avoid creating them. Note that the starting point of the profile is the center of the extrusion. If you use a profile as the top it will rise upwards. If you use it as the bottom it will be inverted, and will go downward.
// - circle: os_circle(r|cut). Define circular rounding either by specifying the radius or cut distance.
2020-01-23 00:30:28 +00:00
// - smooth: os_smooth(cut|joint). Define continuous curvature rounding, with `cut` and `joint` as for round_corners.
// - teardrop: os_teardrop(r|cut). Rounding using a 1/8 circle that then changes to a 45 degree chamfer. The chamfer is at the end, and enables the object to be 3d printed without support. The radius gives the radius of the circular part.
// - chamfer: os_chamfer([height], [width], [cut], [angle]). Chamfer the edge at desired angle or with desired height and width. You can specify height and width together and the angle will be ignored, or specify just one of height and width and the angle is used to determine the shape. Alternatively, specify "cut" along with angle to specify the cut back distance of the chamfer.
//
// The general settings that you can use with all of the helper functions are mostly used to control how offset_sweep() calls the offset() function.
// - extra: Add an extra vertical step of the specified height, to be used for intersections or differences. This extra step will extend the resulting object beyond the height you specify. Default: 0
// - steps: Number of vertical steps to use for the profile. (Not used by os_profile). Default: 16
// - offset: Select "round" (r=), "delta" (delta=), or "chamfer" offset types for offset. Default: "round"
//
2020-05-20 04:56:09 +00:00
// Many of the arguments are described as setting "default" values because they establish settings which may be overridden by
// the top and bottom profile specifications.
2020-01-23 00:30:28 +00:00
//
2020-05-20 04:56:09 +00:00
// You will generally want to use the above helper functions to generate the profiles.
2020-01-23 00:30:28 +00:00
// The profile specification is a list of pairs of keywords and values, e.g. ["r",12, type, "circle"]. The keywords are
// - "type" - type of rounding to apply, one of "circle", "teardrop", "chamfer", "smooth", or "profile" (Default: "circle")
// - "r" - the radius of the roundover, which may be zero for no roundover, or negative to round or flare outward. Default: 0
// - "cut" - the cut distance for the roundover or chamfer, which may be negative for flares
// - "chamfer_width" - the width of a chamfer
// - "chamfer_height" - the height of a chamfer
// - "angle" - the chamfer angle, measured from the vertical (so zero is vertical, 90 is horizontal). Default: 45
// - "joint" - the joint distance for a "smooth" roundover
// - "k" - the curvature smoothness parameter for "smooth" roundovers, a value in [0,1]. Default: 0.75
// - "points" - point list for use with the "profile" type
2020-05-20 04:56:09 +00:00
// - "extra" - extra height added for unions/differences. This makes the shape taller than the requested height. (Default: 0)
2020-01-23 00:30:28 +00:00
// - "steps" - number of vertical steps to use for the roundover. Default: 16.
// - "offset" - select "round" (r=) or "delta" (delta=) offset type for offset. Default: "round"
//
2020-01-25 05:40:03 +00:00
// Note that unlike `offset_sweep`, because the offset operation is always performed from the base shape, using chamfered offsets does not increase the
2020-05-20 04:56:09 +00:00
// number of vertices or lead to any special complications.
2020-01-25 05:40:03 +00:00
//
2020-01-23 00:30:28 +00:00
// Arguments:
2020-05-20 04:56:09 +00:00
// height / l / h = total height (including rounded portions, but not extra sections) of the output. Default: combined height of top and bottom end treatments.
// top = rounding spec for the top end.
// bottom = rounding spec for the bottom end
2020-01-23 00:30:28 +00:00
// offset = default offset, `"round"`, `"delta"`, or `"chamfer"`. Default: `"round"`
// steps = default step count. Default: 16
// extra = default extra height. Default: 0
// cut = default cut value.
// chamfer_width = default width value for chamfers.
// chamfer_height = default height value for chamfers.
// angle = default angle for chamfers. Default: 45
// joint = default joint value for smooth roundover.
// k = default curvature parameter value for "smooth" roundover
// convexity = convexity setting for use with polyhedron. Default: 10
//
// Example: Chamfered elliptical prism. If you stretch a chamfered cylinder the chamfer will be uneven.
// convex_offset_extrude(bottom = os_chamfer(height=-2), top=os_chamfer(height=1), height=7)
// xscale(4)circle(r=6);
// Example: Elliptical prism with circular roundovers.
// convex_offset_extrude(bottom=os_circle(r=-2), top=os_circle(r=1), height=7,steps=10)
// xscale(4)circle(r=6);
// Example: If you give a non-convex input you get a convex hull output
// right(50) linear_extrude(height=7) star(5,r=22,ir=13);
// convex_offset_extrude(bottom = os_chamfer(height=-2), top=os_chamfer(height=1), height=7)
2020-03-01 03:16:43 +00:00
// star(5,r=22,ir=13);
2020-01-23 00:30:28 +00:00
module convex_offset_extrude (
2020-05-21 20:47:12 +00:00
height , h , l ,
top = [ ] , bottom = [ ] ,
offset = "round" , r = 0 , steps = 16 ,
extra = 0 ,
cut = undef , chamfer_width = undef , chamfer_height = undef ,
joint = undef , k = 0.75 , angle = 45 ,
convexity = 10 , thickness = 1 / 1024
2020-01-23 00:30:28 +00:00
) {
2020-05-21 20:47:12 +00:00
argspec = [
[ "r" , r ] ,
[ "extra" , extra ] ,
[ "type" , "circle" ] ,
[ "steps" , steps ] ,
[ "offset" , offset ] ,
[ "chamfer_width" , chamfer_width ] ,
[ "chamfer_height" , chamfer_height ] ,
[ "angle" , angle ] ,
[ "cut" , cut ] ,
[ "joint" , joint ] ,
[ "k" , k ] ,
[ "points" , [ ] ] ,
] ;
top = struct_set ( argspec , top , grow = false ) ;
bottom = struct_set ( argspec , bottom , grow = false ) ;
offsets_bot = _rounding_offsets ( bottom , - 1 ) ;
offsets_top = _rounding_offsets ( top , 1 ) ;
// "Extra" height enlarges the result beyond the requested height, so subtract it
bottom_height = len ( offsets_bot ) = = 0 ? 0 : abs ( select ( offsets_bot , - 1 ) [ 1 ] ) - struct_val ( bottom , "extra" ) ;
top_height = len ( offsets_top ) = = 0 ? 0 : abs ( select ( offsets_top , - 1 ) [ 1 ] ) - struct_val ( top , "extra" ) ;
2020-01-23 00:30:28 +00:00
height = get_height ( l = l , h = h , height = height , dflt = bottom_height + top_height ) ;
2020-05-21 20:47:12 +00:00
assert ( height >= 0 , "Height must be nonnegative" ) ;
middle = height - bottom_height - top_height ;
assert (
middle >= 0 , str (
"Specified end treatments (bottom height = " , bottom_height ,
" top_height = " , top_height , ") are too large for extrusion height (" , height , ")"
)
) ;
2020-01-23 00:30:28 +00:00
// The entry r[i] is [radius,z] for a given layer
r = move ( [ 0 , bottom_height ] , p = concat (
reverse ( offsets_bot ) , [ [ 0 , 0 ] , [ 0 , middle ] ] , move ( [ 0 , middle ] , p = offsets_top ) ) ) ;
delta = [ for ( val = deltas ( subindex ( r , 0 ) ) ) sign ( val ) ] ;
below = [ - thickness , 0 ] ;
above = [ 0 , thickness ] ;
// layers is a list of pairs of the relative positions for each layer, e.g. [0,thickness]
2020-05-20 04:56:09 +00:00
// puts the layer above the polygon, and [-thickness,0] puts it below.
2020-01-23 00:30:28 +00:00
layers = [ for ( i = [ 0 : len ( r ) - 1 ] )
i = = 0 ? ( delta [ 0 ] < 0 ? below : above ) :
i = = len ( r ) - 1 ? ( delta [ len ( delta ) - 1 ] < 0 ? below : above ) :
delta [ i ] = = 0 ? above :
delta [ i + 1 ] = = 0 ? below :
delta [ i ] = = delta [ i - 1 ] ? [ - thickness / 2 , thickness / 2 ] :
delta [ i ] = = 1 ? above :
/* delta[i] == -1 ? */ below ] ;
dochamfer = offset = = "chamfer" ;
for ( i = [ 0 : len ( r ) - 2 ] )
for ( j = [ 0 : $children - 1 ] )
hull ( ) {
up ( r [ i ] [ 1 ] + layers [ i ] [ 0 ] )
linear_extrude ( convexity = convexity , height = layers [ i ] [ 1 ] - layers [ i ] [ 0 ] )
if ( offset = = "round" )
offset ( r = r [ i ] [ 0 ] )
children ( j ) ;
else
offset ( delta = r [ i ] [ 0 ] , chamfer = dochamfer )
children ( j ) ;
up ( r [ i + 1 ] [ 1 ] + layers [ i + 1 ] [ 0 ] )
linear_extrude ( convexity = convexity , height = layers [ i + 1 ] [ 1 ] - layers [ i + 1 ] [ 0 ] )
if ( offset = = "round" )
offset ( r = r [ i + 1 ] [ 0 ] )
children ( j ) ;
else
offset ( delta = r [ i + 1 ] [ 0 ] , chamfer = dochamfer )
children ( j ) ;
}
}
2019-07-13 00:17:36 +00:00
function _remove_undefined_vals ( list ) =
2020-05-21 20:47:12 +00:00
let ( ind = search ( [ undef ] , list , 0 ) [ 0 ] )
list_remove ( list , concat ( ind , add_scalar ( ind , - 1 ) ) ) ;
2019-07-13 00:17:36 +00:00
2019-08-01 20:36:53 +00:00
// Function&Module: offset_stroke()
// Usage:
// offset_stroke(path, [width], [rounded], [chamfer], [start], [end], [check_valid], [quality], [maxstep], [closed])
// Description:
// Uses `offset()` to compute a stroke for the input path. Unlike `stroke`, the result does not need to be
// centered on the input path. The corners can be rounded, pointed, or chamfered, and you can make the ends
// rounded, flat or pointed with the `start` and `end` parameters.
//
// The `check_valid`, `quality` and `maxstep` parameters are passed through to `offset()`
//
// If `width` is a scalar then the output will be a centered stroke of the specified width. If width
// is a list of two values then those two values will define the stroke side positions relative to the center line, where
// as with offset(), the shift is to the left for open paths and outward for closed paths. For example,
// setting `width` to `[0,1]` will create a stroke of width 1 that extends entirely to the left of the input, and and [-4,-6]
// will create a stroke of width 2 offset 4 units to the right of the input path.
//
// If closed==false then the function form will return a path. If closed==true then it will return a region. The `start` and
2020-05-20 04:56:09 +00:00
// `end` parameters are forbidden for closed paths.
2019-08-01 20:36:53 +00:00
//
// Three simple end treatments are supported, "flat" (the default), "round" and "pointed". The "flat" treatment
// cuts off the ends perpendicular to the path and the "round" treatment applies a semicircle to the end. The
// "pointed" end treatment caps the stroke with a centered triangle that has 45 degree angles on each side.
//
2020-05-20 04:56:09 +00:00
// More complex end treatments are available through parameter lists with helper functions to ease parameter passing. The parameter list
2019-08-01 20:36:53 +00:00
// keywords are
// - "type": the type of end treatment, one of "shifted_point", "roundover", or "flat"
// - "angle": relative angle (relative to the path)
// - "abs_angle": absolute angle (angle relative to x-axis)
// - "cut": cut distance for roundovers, a single value to round both corners identically or a list of two values for the two corners. Negative values round outward.
// - "k": curvature smoothness parameter for roundovers, default 0.75
//
// Function helpers for defining ends, prefixed by "os" for offset_stroke.
//
// os_flat(angle|absangle): specify a flat end either relative to the path or relative to the x-axis
// os_pointed(loc,dist): specify a pointed tip where the point is distance `loc` from the centerline (positive is the left direction as for offset), and `dist` is the distance from the path end to the point tip. The default value for `loc` is zero (the center). You must specify `dist` when using this option.
// os_round(cut,angle|absangle,k). Rounded ends with the specified cut distance, based on the specified angle or absolute angle. The `k` parameter is the smoothness parameter for continuous curvature rounding.
//
2020-05-20 04:56:09 +00:00
// Note that `offset_stroke()` will attempt to apply roundovers and angles at the ends even when it means deleting segments of the stroke, unlike round_corners which only works on a segment adjacent to a corner. If you specify an overly extreme angle it will fail to find an intersection with the stroke and display an error. When you specify an angle the end segment is rotated around the center of the stroke and the last segment of the stroke one one side is extended to the corner.
2019-08-01 20:36:53 +00:00
//
// The $fn and $fs variables are used to determine the number of segments for rounding, while maxstep is used to determine the segments of `offset`. If you
2020-05-20 04:56:09 +00:00
// get the expected rounding along the path, decrease `maxstep` and if the curves created by `os_round()` are too coarse, adjust $fn or $fs.
2019-08-01 20:36:53 +00:00
//
// Arguments:
// path = path that defines the stroke
// width = width of the stroke, a scalar or a vector of 2 values giving the offset from the path. Default: 1
// rounded = set to true to use rounded offsets, false to use sharp (delta) offsets. Default: true
// chamfer = set to true to use chamfers when `rounded=false`. Default: false
// start = end streatment for the start of the stroke. See above for details. Default: "flat"
// end = end streatment for the end of the stroke. See above for details. Default: "flat"
// check_valid = passed to offset(). Default: true
// quality = passed to offset(). Default: 1
// maxstep = passed to offset() to define number of points in the offset. Default: 0.1
// closed = true if the curve is closed, false otherwise. Default: false
2019-08-02 01:42:23 +00:00
//
2020-05-20 04:56:09 +00:00
// Example(2D): Basic examples illustrating flat, round, and pointed ends, on a finely sampled arc and a path made from 3 segments.
2019-08-01 20:36:53 +00:00
// arc = arc(points=[[1,1],[3,4],[6,3]],N=50);
2020-05-20 04:56:09 +00:00
// path = [[0,0],[6,2],[9,7],[8,10]];
2019-08-01 20:36:53 +00:00
// xdistribute(spacing=10){
// offset_stroke(path, width = 2);
// offset_stroke(path, start="round", end="round", width = 2);
// offset_stroke(path, start="pointed", end="pointed", width = 2);
2020-05-20 04:56:09 +00:00
// }
2019-08-01 20:36:53 +00:00
// fwd(10) xdistribute(spacing=10){
// offset_stroke(arc, width = 2);
// offset_stroke(arc, start="round", end="round", width = 2);
// offset_stroke(arc, start="pointed", end="pointed", width = 2);
// }
2020-05-20 04:56:09 +00:00
// Example(2D): The effect of the `rounded` and `chamfer` options is most evident at sharp corners. This only affects the middle of the path, not the ends.
2019-08-01 20:36:53 +00:00
// sharppath = [[0,0], [1.5,5], [3,0]];
// xdistribute(spacing=5){
// offset_stroke(sharppath);
// offset_stroke(sharppath, rounded=false);
// offset_stroke(sharppath, rounded=false, chamfer=true);
// }
2020-05-20 04:56:09 +00:00
// Example(2D): When closed is enabled all the corners are affected by those options.
2019-08-01 20:36:53 +00:00
// sharppath = [[0,0], [1.5,5], [3,0]];
// xdistribute(spacing=5){
// offset_stroke(sharppath,closed=true);
// offset_stroke(sharppath, rounded=false, closed=true);
// offset_stroke(sharppath, rounded=false, chamfer=true, closed=true);
// }
2020-05-20 04:56:09 +00:00
// Example(2D): The left stroke uses flat ends with a relative angle of zero. The right hand one uses flat ends with an absolute angle of zero, so the ends are parallel to the x-axis.
// path = [[0,0],[6,2],[9,7],[8,10]];
2019-08-02 01:42:23 +00:00
// offset_stroke(path, start=os_flat(angle=0), end=os_flat(angle=0));
2019-08-01 20:36:53 +00:00
// right(5)
2019-08-02 01:42:23 +00:00
// offset_stroke(path, start=os_flat(abs_angle=0), end=os_flat(abs_angle=0));
2020-05-20 04:56:09 +00:00
// Example(2D): With continuous sampling the end treatment can remove segments or extend the last segment linearly, as shown here. Again the left side uses relative angle flat ends and the right hand example uses absolute angle.
2019-08-01 20:36:53 +00:00
// arc = arc(points=[[4,0],[3,4],[6,3]],N=50);
// offset_stroke(arc, start=os_flat(angle=45), end=os_flat(angle=45));
// right(5)
// offset_stroke(arc, start=os_flat(abs_angle=45), end=os_flat(abs_angle=45));
2020-05-20 04:56:09 +00:00
// Example(2D): The os_pointed() end treatment allows adjustment of the point tip, as shown here. The width is 2 so a location of 1 is at the edge.
2019-08-01 20:36:53 +00:00
// arc = arc(points=[[1,1],[3,4],[6,3]],N=50);
// offset_stroke(arc, width=2, start=os_pointed(loc=1,dist=3),end=os_pointed(loc=1,dist=3));
// right(10)
// offset_stroke(arc, width=2, start=os_pointed(dist=4),end=os_pointed(dist=-1));
2020-05-20 04:56:09 +00:00
// fwd(7)
2019-08-01 20:36:53 +00:00
// offset_stroke(arc, width=2, start=os_pointed(loc=2,dist=2),end=os_pointed(loc=.5,dist=-1));
2020-05-20 04:56:09 +00:00
// Example(2D): The os_round() end treatment adds roundovers to the end corners by specifying the `cut` parameter. In the first example, the cut parameter is the same at each corner. The bezier smoothness parameter `k` is given to allow a larger cut. In the second example, each corner is given a different roundover, including zero for no rounding at all. The red shows the same strokes without the roundover.
2019-08-01 20:36:53 +00:00
// arc = arc(points=[[1,1],[3,4],[6,3]],N=50);
2020-05-20 04:56:09 +00:00
// path = [[0,0],[6,2],[9,7],[8,10]];
2019-08-01 20:36:53 +00:00
// offset_stroke(path, width=2, rounded=false,start=os_round(angle=-20, cut=0.4,k=.9), end=os_round(angle=-35, cut=0.4,k=.9));
// color("red")down(.1)offset_stroke(path, width=2, rounded=false,start=os_flat(-20), end=os_flat(-35));
// right(9){
// offset_stroke(arc, width=2, rounded=false, start=os_round(cut=[.3,.6],angle=-45), end=os_round(angle=20,cut=[.6,0]));
// color("red")down(.1)offset_stroke(arc, width=2, rounded=false, start=os_flat(-45), end=os_flat(20));
// }
2020-05-20 04:56:09 +00:00
// Example(2D): Negative cut values produce a flaring end. Note how the absolute angle aligns the ends of the first example withi the axes. In the second example positive and negative cut values are combined. Note also that very different cuts are needed at the start end to produce a similar looking flare.
2019-08-01 20:36:53 +00:00
// arc = arc(points=[[1,1],[3,4],[6,3]],N=50);
2020-05-20 04:56:09 +00:00
// path = [[0,0],[6,2],[9,7],[8,10]];
2019-08-01 20:36:53 +00:00
// offset_stroke(path, width=2, rounded=false,start=os_round(cut=-1, abs_angle=90), end=os_round(cut=-0.5, abs_angle=0));
// right(10)
// offset_stroke(arc, width=2, rounded=false, start=os_round(cut=[-.75,-.2], angle=-45), end=os_round(cut=[-.2,.2], angle=20));
// Example(2D): Setting the width to a vector allows generation of a set of parallel strokes
2020-05-20 04:56:09 +00:00
// path = [[0,0],[4,4],[8,4],[2,9],[10,10]];
2019-08-01 20:36:53 +00:00
// for(i=[0:.25:2])
// offset_stroke(path, rounded=false,width = [i,i+.08]);
2020-05-20 04:56:09 +00:00
// Example(2D): Setting rounded=true in the above example makes a very big difference in the result.
// path = [[0,0],[4,4],[8,4],[2,9],[10,10]];
2019-08-01 20:36:53 +00:00
// for(i=[0:.25:2])
// offset_stroke(path, rounded=true,width = [i,i+.08]);
2020-05-20 04:56:09 +00:00
// Example(2D): In this example a spurious triangle appears. This results from overly enthusiastic validity checking. Turning validity checking off fixes it in this case.
// path = [[0,0],[4,4],[8,4],[2,9],[10,10]];
2019-08-01 20:36:53 +00:00
// offset_stroke(path, check_valid=true,rounded=false,width = [1.4, 1.45]);
// right(2)
// offset_stroke(path, check_valid=false,rounded=false,width = [1.4, 1.45]);
2020-05-20 04:56:09 +00:00
// Example(2D): But in this case, disabling the validity check produces an invalid result.
// path = [[0,0],[4,4],[8,4],[2,9],[10,10]];
2019-08-01 20:36:53 +00:00
// offset_stroke(path, check_valid=true,rounded=false,width = [1.9, 2]);
// translate([1,-0.25])
// offset_stroke(path, check_valid=false,rounded=false,width = [1.9, 2]);
// Example(2D): Self-intersecting paths are handled differently than with the `stroke()` module.
// path = turtle(["move",10,"left",144], repeat=4);
// stroke(path, closed=true);
// right(12)
// offset_stroke(path, width=1, closed=true);
function offset_stroke ( path , width = 1 , rounded = true , start = "flat" , end = "flat" , check_valid = true , quality = 1 , maxstep = 0.1 , chamfer = false , closed = false ) =
2020-05-21 20:47:12 +00:00
let ( closedok = ! closed || ( is_undef ( start ) && is_undef ( end ) ) )
assert ( closedok , "Parameters `start` and `end` not allowed with closed path" )
let (
start = closed ? [ ] : _parse_stroke_end ( default ( start , "flat" ) ) ,
end = closed ? [ ] : _parse_stroke_end ( default ( end , "flat" ) ) ,
width = is_list ( width ) ? reverse ( sort ( width ) ) : [ 1 , - 1 ] * width / 2 ,
left_r = ! rounded ? undef : width [ 0 ] ,
left_delta = rounded ? undef : width [ 0 ] ,
right_r = ! rounded ? undef : width [ 1 ] ,
right_delta = rounded ? undef : width [ 1 ] ,
left_path = offset (
path , delta = left_delta , r = left_r , closed = closed ,
check_valid = check_valid , quality = quality ,
chamfer = chamfer , maxstep = maxstep
) ,
right_path = offset (
path , delta = right_delta , r = right_r , closed = closed ,
check_valid = check_valid , quality = quality ,
chamfer = chamfer , maxstep = maxstep
)
)
closed ? [ left_path , right_path ] :
let (
startpath = _stroke_end ( width , left_path , right_path , start ) ,
endpath = _stroke_end ( reverse ( width ) , reverse ( right_path ) , reverse ( left_path ) , end ) ,
clipping_ok = startpath [ 1 ] + endpath [ 2 ] < = len ( left_path ) && startpath [ 2 ] + endpath [ 1 ] < = len ( right_path )
)
assert ( clipping_ok , "End treatment removed the whole stroke" )
concat (
slice ( left_path , startpath [ 1 ] , - 1 - endpath [ 2 ] ) ,
endpath [ 0 ] ,
reverse ( slice ( right_path , startpath [ 2 ] , - 1 - endpath [ 1 ] ) ) ,
startpath [ 0 ]
) ;
2019-08-01 20:36:53 +00:00
function os_pointed ( loc = 0 , dist ) =
2020-05-21 20:47:12 +00:00
assert ( is_def ( dist ) , "Must specify `dist`" )
[
"type" , "shifted_point" ,
"loc" , loc ,
"dist" , dist
] ;
2019-08-01 20:36:53 +00:00
function os_round ( cut , angle , abs_angle , k ) =
2020-05-21 20:47:12 +00:00
let (
acount = num_defined ( [ angle , abs_angle ] ) ,
use_angle = first_defined ( [ angle , abs_angle , 0 ] )
)
assert ( acount < 2 , "You must define only one of `angle` and `abs_angle`" )
assert ( is_def ( cut ) , "Parameter `cut` not defined." )
[
"type" , "roundover" ,
"angle" , use_angle ,
"absolute" , is_def ( abs_angle ) ,
"cut" , is_vector ( cut ) ? point2d ( cut ) : [ cut , cut ] ,
"k" , first_defined ( [ k , 0.75 ] )
] ;
2019-08-01 20:36:53 +00:00
2020-05-20 04:56:09 +00:00
function os_flat ( angle , abs_angle ) =
2020-05-21 20:47:12 +00:00
let (
acount = num_defined ( [ angle , abs_angle ] ) ,
use_angle = first_defined ( [ angle , abs_angle , 0 ] )
)
assert ( acount < 2 , "You must define only one of `angle` and `abs_angle`" )
[
"type" , "flat" ,
"angle" , use_angle ,
"absolute" , is_def ( abs_angle )
] ;
2019-08-10 06:57:19 +00:00
2019-08-01 20:36:53 +00:00
// Return angle in (-90,90] required to map line1 onto line2 (lines specified as lists of two points)
2019-08-10 06:57:19 +00:00
function angle_between_lines ( line1 , line2 ) =
2020-05-21 20:47:12 +00:00
let ( angle = atan2 ( det2 ( [ line1 , line2 ] ) , line1 * line2 ) )
angle > 90 ? angle - 180 :
angle < = - 90 ? angle + 180 :
angle ;
2019-08-01 20:36:53 +00:00
function _parse_stroke_end ( spec ) =
2020-05-21 20:47:12 +00:00
is_string ( spec ) ?
assert (
in_list ( spec , [ "flat" , "round" , "pointed" ] ) ,
str ( "Unknown end string specification \"" , spec , "\". Must be \"flat\", \"round\", or \"pointed\"" )
)
[ [ "type" , spec ] ] :
struct_set ( [ ] , spec ) ;
2019-08-01 20:36:53 +00:00
function _stroke_end ( width , left , right , spec ) =
2020-05-21 20:47:12 +00:00
let (
type = struct_val ( spec , "type" ) ,
user_angle = default ( struct_val ( spec , "angle" ) , 0 ) ,
normal_seg = _normal_segment ( right [ 0 ] , left [ 0 ] ) ,
normal_pt = normal_seg [ 1 ] ,
center = normal_seg [ 0 ] ,
parallel_dir = unit ( left [ 0 ] - right [ 0 ] ) ,
normal_dir = unit ( normal_seg [ 1 ] - normal_seg [ 0 ] ) ,
width_dir = sign ( width [ 0 ] - width [ 1 ] )
)
type = = "round" ? [ arc ( points = [ right [ 0 ] , normal_pt , left [ 0 ] ] , N = 50 ) , 1 , 1 ] :
type = = "pointed" ? [ [ normal_pt ] , 0 , 0 ] :
type = = "shifted_point" ? (
let ( shiftedcenter = center + width_dir * parallel_dir * struct_val ( spec , "loc" ) )
[ [ shiftedcenter + normal_dir * struct_val ( spec , "dist" ) ] , 0 , 0 ]
) :
// Remaining types all support angled cutoff, so compute that
assert ( abs ( user_angle ) < = 90 , "End angle must be in [-90,90]" )
let (
angle = struct_val ( spec , "absolute" ) ?
angle_between_lines ( left [ 0 ] - right [ 0 ] , [ cos ( user_angle ) , sin ( user_angle ) ] ) :
user_angle ,
endseg = [ center , rot ( p = [ left [ 0 ] ] , angle , cp = center ) [ 0 ] ] ,
intright = angle > 0 ,
pathclip = _path_line_intersection ( intright ? right : left , endseg ) ,
pathextend = line_intersection ( endseg , select ( intright ? left : right , 0 , 1 ) )
)
type = = "flat" ? (
intright ?
[ [ pathclip [ 0 ] , pathextend ] , 1 , pathclip [ 1 ] ] :
[ [ pathextend , pathclip [ 0 ] ] , pathclip [ 1 ] , 1 ]
) :
type = = "roundover" ? (
let (
bez_k = struct_val ( spec , "k" ) ,
cut = struct_val ( spec , "cut" ) ,
cutleft = cut [ 0 ] ,
cutright = cut [ 1 ] ,
// Create updated paths taking into account clipping for end rotation
newright = intright ?
concat ( [ pathclip [ 0 ] ] , select ( right , pathclip [ 1 ] , - 1 ) ) :
concat ( [ pathextend ] , select ( right , 1 , - 1 ) ) ,
newleft = ! intright ?
concat ( [ pathclip [ 0 ] ] , select ( left , pathclip [ 1 ] , - 1 ) ) :
concat ( [ pathextend ] , select ( left , 1 , - 1 ) ) ,
// calculate corner angles, which are different when the cut is negative (outside corner)
leftangle = cutleft >= 0 ?
vector_angle ( [ newleft [ 1 ] , newleft [ 0 ] , newright [ 0 ] ] ) / 2 :
90 - vector_angle ( [ newleft [ 1 ] , newleft [ 0 ] , newright [ 0 ] ] ) / 2 ,
rightangle = cutright >= 0 ?
vector_angle ( [ newright [ 1 ] , newright [ 0 ] , newleft [ 0 ] ] ) / 2 :
90 - vector_angle ( [ newright [ 1 ] , newright [ 0 ] , newleft [ 0 ] ] ) / 2 ,
jointleft = 8 * cutleft / cos ( leftangle ) / ( 1 + 4 * bez_k ) ,
jointright = 8 * cutright / cos ( rightangle ) / ( 1 + 4 * bez_k ) ,
pathcutleft = path_cut ( newleft , abs ( jointleft ) ) ,
pathcutright = path_cut ( newright , abs ( jointright ) ) ,
leftdelete = intright ? pathcutleft [ 1 ] : pathcutleft [ 1 ] + pathclip [ 1 ] - 1 ,
rightdelete = intright ? pathcutright [ 1 ] + pathclip [ 1 ] - 1 : pathcutright [ 1 ] ,
leftcorner = line_intersection ( [ pathcutleft [ 0 ] , newleft [ pathcutleft [ 1 ] ] ] , [ newright [ 0 ] , newleft [ 0 ] ] ) ,
rightcorner = line_intersection ( [ pathcutright [ 0 ] , newright [ pathcutright [ 1 ] ] ] , [ newright [ 0 ] , newleft [ 0 ] ] ) ,
roundover_fits = jointleft + jointright < norm ( rightcorner - leftcorner )
)
assert ( roundover_fits , "Roundover too large to fit" )
let (
angled_dir = unit ( newleft [ 0 ] - newright [ 0 ] ) ,
nPleft = [
leftcorner - jointleft * angled_dir ,
leftcorner ,
pathcutleft [ 0 ]
] ,
nPright = [
pathcutright [ 0 ] ,
rightcorner ,
rightcorner + jointright * angled_dir
] ,
leftcurve = _bezcorner ( nPleft , bez_k ) ,
rightcurve = _bezcorner ( nPright , bez_k )
)
[ concat ( rightcurve , leftcurve ) , leftdelete , rightdelete ]
) : [ [ ] , 0 , 0 ] ; // This case shouldn't occur
2019-08-10 06:57:19 +00:00
2019-08-01 20:36:53 +00:00
// returns [intersection_pt, index of first point in path after the intersection]
2020-05-20 04:56:09 +00:00
function _path_line_intersection ( path , line , ind = 0 ) =
2020-05-21 20:47:12 +00:00
ind = = len ( path ) - 1 ? undef :
let ( intersect = line_segment_intersection ( line , select ( path , ind , ind + 1 ) ) )
// If it intersects the segment excluding it's final point, then we're done
// The final point is treated as part of the next segment
is_def ( intersect ) && intersect ! = path [ ind + 1 ] ?
[ intersect , ind + 1 ] :
_path_line_intersection ( path , line , ind + 1 ) ;
2019-08-01 20:36:53 +00:00
2020-05-20 04:56:09 +00:00
module offset_stroke ( path , width = 1 , rounded = true , start , end , check_valid = true , quality = 1 , maxstep = 0.1 , chamfer = false , closed = false )
2019-08-01 20:36:53 +00:00
{
2019-08-29 01:15:41 +00:00
no_children ( $children ) ;
2020-05-21 20:47:12 +00:00
result = offset_stroke (
path , width = width , rounded = rounded ,
start = start , end = end ,
check_valid = check_valid , quality = quality ,
maxstep = maxstep , chamfer = chamfer ,
closed = closed
) ;
if ( closed ) {
region ( result ) ;
} else {
polygon ( result ) ;
}
2019-08-01 20:36:53 +00:00
}
2020-03-29 03:41:37 +00:00
function _rp_compute_patches ( top , bot , rtop , rsides , ktop , ksides , concave ) =
let (
N = len ( top ) ,
plane = plane3pt_indexed ( top , 0 , 1 , 2 ) ,
rtop_in = is_list ( rtop ) ? rtop [ 0 ] : rtop ,
rtop_down = is_list ( rtop ) ? rtop [ 1 ] : abs ( rtop )
)
[ for ( i = [ 0 : N - 1 ] )
let (
rside_prev = is_list ( rsides [ i ] ) ? rsides [ i ] [ 0 ] : rsides [ i ] ,
rside_next = is_list ( rsides [ i ] ) ? rsides [ i ] [ 1 ] : rsides [ i ] ,
2020-05-21 20:47:12 +00:00
concave_sign = ( concave [ i ] ? - 1 : 1 ) * ( rtop_in >= 0 ? 1 : - 1 ) , // Negative if normals need to go "out"
2020-03-29 03:41:37 +00:00
prev = select ( top , i - 1 ) - top [ i ] ,
next = select ( top , i + 1 ) - top [ i ] ,
prev_offset = top [ i ] + rside_prev * unit ( prev ) / sin ( vector_angle ( prev , bot [ i ] - top [ i ] ) ) ,
next_offset = top [ i ] + rside_next * unit ( next ) / sin ( vector_angle ( next , bot [ i ] - top [ i ] ) ) ,
down = rtop_down * unit ( bot [ i ] - top [ i ] ) / sin ( abs ( plane_line_angle ( plane , [ bot [ i ] , top [ i ] ] ) ) ) ,
row2 = [ prev_offset , top [ i ] , next_offset ] ,
row4 = [ prev_offset + down , top [ i ] + down , next_offset + down ] ,
in_prev = concave_sign * unit ( next - ( next * prev ) * prev / ( prev * prev ) ) ,
in_next = concave_sign * unit ( prev - ( prev * next ) * next / ( next * next ) ) ,
2020-05-21 20:47:12 +00:00
far_corner = top [ i ] + concave_sign * unit ( unit ( prev ) + unit ( next ) ) * abs ( rtop_in ) / sin ( vector_angle ( prev , next ) / 2 ) ,
2020-05-20 04:56:09 +00:00
row0 =
2020-03-29 03:41:37 +00:00
concave_sign < 0 ?
[ prev_offset + abs ( rtop_in ) * in_prev , far_corner , next_offset + abs ( rtop_in ) * in_next ]
:
let (
prev_corner = prev_offset + abs ( rtop_in ) * in_prev ,
next_corner = next_offset + abs ( rtop_in ) * in_next ,
prev_degenerate = is_undef ( ray_intersection ( [ far_corner , far_corner + prev ] , [ prev_offset , prev_offset + in_prev ] ) ) ,
next_degenerate = is_undef ( ray_intersection ( [ far_corner , far_corner + next ] , [ next_offset , next_offset + in_next ] ) )
)
[ prev_degenerate ? far_corner : prev_corner ,
far_corner ,
next_degenerate ? far_corner : next_corner ]
) _smooth_bez_fill (
[ for ( row = [ row0 , row2 , row4 ] ) _smooth_bez_fill ( row , ksides [ i ] ) ] ,
ktop ) ] ;
// Function&Module: rounded_prism()
// Usage:
// rounded_prism(bottom, [top], joint_top, joint_bot, joint_sides, [k], [k_top], [k_bot], [k_sides], [splinesteps], [height|h|length|l], [debug], [convexity])
// vnf = rounded_prism(bottom, [top], joint_top, joint_bot, joint_sides, [k], [k_top], [k_bot], [k_sides], [splinesteps], [height|h|length|l], [debug])
// Description:
// Construct a generalized prism with continuous curvature rounding. You supply the polygons for the top and bottom of the prism. The only
// limitation is that joining the edges must produce a valid polyhedron with coplaner side faces. You specify the rounding by giving
// the joint distance away from the corner for the rounding curve. The k parameter ranges from 0 to 1 with a default of 0.5. Larger
// values give a more abrupt transition and smaller ones a more gradual transition. If you set the value much higher
// than 0.8 the curvature changes abruptly enough that though it is theoretically continuous, it may
// not be continous in practice. A value of 0.92 is a good approximation to a circle. If you set it very small then the transition
// is so gradual that the roundover may be very small. If you want a very smooth roundover, set the joint parameter as large as possible and
// then adjust the k value down as low as gives a sufficiently large roundover.
//
// You can specify the bottom and top polygons by giving two compatible 3d paths. You can also give 2d paths and a height/length and the
// two shapes will be offset in the z direction from each other. The final option is to specify just the bottom along with a height/length;
// in this case the top will be a copy of the bottom, offset in the z direction by the specified height.
//
// You define rounding for all of the top edges, all of the bottom edges, and independently for each of the connecting side edges.
// You specify rounding the rounding by giving the joint distance for where the curved section should start. If the joint distance is 1 then
// it means the curved section begins 1 unit away from the edge (in the perpendicular direction). Typically each joint distance is a scalar
// value and the rounding is symmetric around each edge. However, you can specify a 2-vector for the joint distance to produce asymmetric
// rounding which is different on the two sides of the edge. This may be useful when one one edge in your polygon is much larger than another.
// For the top and bottom you can specify negative joint distances. If you give a scalar negative value then the roundover will flare
// outward. If you give a vector value then a negative value then if joint_top[0] is negative the shape will flare outward, but if
// joint_top[1] is negative the shape will flare upward. At least one value must be non-negative. The same rules apply for joint_bot.
// The joint_sides parameter must be entirely nonnegative.
//
// If you set `debug` to true the module version will display the polyhedron even when it is invalid and it will show the bezier patches at the corners.
// This can help troubleshoot problems with your parameters. With the function form setting debug to true causes it to return [patches,vnf] where
2020-05-21 20:47:12 +00:00
// patches is a list of the bezier control points for the corner patches.
2020-03-29 03:41:37 +00:00
//
// Arguments:
// bottom = 2d or 3d path describing bottom polygon
// top = 2d or 3d path describing top polygon (must be the same dimension as bottom)
// height/length/h/l = height of the shape when you give 2d bottom
// joint_top = rounding length for top (number or 2-vector)
// joint_bot = rounding length for bottom (number or 2-vector)
// joint_sides = rounding length for side edges, a number/2-vector or list of them
// k = continuous curvature rounding parameter for all edges. Default: 0.5
// k_top = continuous curvature rounding parameter for top
// k_bot = continuous curvature rounding parameter for bottom
// k_bot = continuous curvature rounding parameter for bottom
// splinesteps = number of segments to use for curved patches. Default: 16
// debug = turn on debug mode which displays illegal polyhedra and shows the bezier corner patches for troubleshooting purposes. Default: False
// convexity = convexity parameter for polyhedron(), only for module version. Default: 10
// Example: Uniformly rounded pentagonal prism
2020-05-20 04:56:09 +00:00
// rounded_prism(pentagon(3), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
2020-05-21 20:47:12 +00:00
// Example: Maximum possible rounding.
2020-03-29 03:41:37 +00:00
// rounded_prism(pentagon(3), height=3, joint_top=1.5, joint_bot=1.5, joint_sides=1.5);
2020-05-21 20:47:12 +00:00
// Example: Decreasing k from the default of 0.5 to 0.3 gives a smoother round over which takes up more space, so it appears less rounded.
2020-03-29 03:41:37 +00:00
// rounded_prism(pentagon(3), height=3, joint_top=1.5, joint_bot=1.5, joint_sides=1.5, k=0.3, splinesteps=32);
2020-05-21 20:47:12 +00:00
// Example: Increasing k from the default of 0.5 to 0.92 approximates a circular roundover, which does not have continuous curvature. Notice the visible "edges" at the boundary of the corner and edge patches.
2020-03-29 03:41:37 +00:00
// rounded_prism(pentagon(3), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=0.5, k=0.92);
// Example: rounding just one edge
// rounded_prism(pentagon(side=3), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=[0,0,0.5,0,0], splinesteps=16);
// Example: rounding all the edges differently
// rounded_prism(pentagon(side=3), height=3, joint_top=0.25, joint_bot=0.5, joint_sides=[1.7,.5,.7,1.2,.4], splinesteps=32);
// Example: different k values for top, bottom and sides
// rounded_prism(pentagon(side=3.0), height=3.0, joint_top=1.4, joint_bot=1.4, joint_sides=0.7, k_top=0.7, k_bot=0.3, k_sides=0.5, splinesteps=48);
// Example: flared bottom
// rounded_prism(pentagon(3), height=3, joint_top=1.0, joint_bot=-0.5, joint_sides=0.5);
// Example: truncated pyramid
// rounded_prism(pentagon(3), apply(scale(.7),pentagon(3)), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
// Example: top translated
// rounded_prism(pentagon(3), apply(right(2),pentagon(3)), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
// Example(NORENDER): top rotated: fails due to non-coplanar side faces
// rounded_prism(pentagon(3), apply(rot(45),pentagon(3)), height=3, joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
// Example: skew top
// rounded_prism(path3d(pentagon(3)), apply(affine3d_skew_yz(0,-20),path3d(pentagon(3),3)), joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
// Example: this rotation gives coplanar sides
// rounded_prism(path3d(square(4)), apply(yrot(-100)*right(2),path3d(square(4),3)), joint_top=0.5, joint_bot=0.5, joint_sides=0.5);
// Example: a shape with concave corners
// M = path3d(turtle(["left", 180, "length",3,"move", "left", "move", 3, "right", "move", "right", "move", 4, "right", "move", 3, "right", "move", 2]));
// rounded_prism(M, apply(up(3),M), joint_top=0.75, joint_bot=0.2, joint_sides=[.2,2.5,2,0.5,1.5,.5,2.5], splinesteps=32);
// Example: using debug mode to see the corner patch sizes, which may help figure out problems with interfering corners or invalid polyhedra. The corner patches must not intersect each other.
// M = path3d(turtle(["left", 180, "length",3,"move", "left", "move", 3, "right", "move", "right", "move", 4, "right", "move", 3, "right", "move", 2]));
// rounded_prism(M, apply(up(3),M), joint_top=0.75, joint_bot=0.2, joint_sides=[.2,2.5,2,0.5,1.5,.5,2.5], splinesteps=16,debug=true);
// Example: applying transformation to the previous example
// M = path3d(turtle(["left", 180, "length",3,"move", "left", "move", 3, "right", "move", "right", "move", 4, "right", "move", 3, "right", "move", 2]));
// rounded_prism(M, apply(right(1)*scale(.75)*up(3),M), joint_top=0.5, joint_bot=0.2, joint_sides=[.2,1,1,0.5,1.5,.5,2], splinesteps=32);
2020-05-21 20:47:12 +00:00
// Example: this example shows most of the different types of patches that rounded_prism creates. Note that some of the patches are close to interfering with each other across the top of the polyhedron, which would create an invalid result.
2020-03-29 03:41:37 +00:00
// N = apply(rot(180)*yscale(.8),turtle(["length",3,"left", "move", 2, "right", 135, "move", sqrt(2), "left", "move", sqrt(2), "right", 135, "move", 2]));
// rounded_prism(N, height=3, joint_bot=0.5, joint_top=1.25, joint_sides=[[1,1.75],0,.5,.5,2], debug=true);
2020-05-21 20:47:12 +00:00
// Example: This object has different scales on its different axies. Here is the largest symmetric rounding that fits. Note that the rounding is slightly smaller than the object dimensions because of roundoff error.
2020-03-29 03:41:37 +00:00
// rounded_prism(square([100.1,30.1]), height=8.1, joint_top=4, joint_bot=4, joint_sides=15, k_sides=0.3, splinesteps=32);
// Example: Using asymetric rounding enables a much more rounded form:
// rounded_prism(square([100.1,30.1]), height=8.1, joint_top=[15,4], joint_bot=[15,4], joint_sides=[[15,50],[50,15],[15,50],[50,15]], k_sides=0.3, splinesteps=32);
2020-05-21 20:47:12 +00:00
// Example: Flaring the top upward instead of outward. The bottom has an asymmetric rounding with a small flare but a large rounding up the side.
2020-03-29 03:41:37 +00:00
// rounded_prism(pentagon(3), height=3, joint_top=[1,-1], joint_bot=[-0.5,2], joint_sides=0.5);
// Example: Sideways polygons:
// rounded_prism(apply(yrot(95),path3d(hexagon(3))), apply(yrot(95), path3d(hexagon(3),3)), joint_top=2, joint_bot=1, joint_sides=1);
2020-05-21 20:47:12 +00:00
module rounded_prism ( bottom , top , joint_bot , joint_top , joint_sides , k_bot , k_top , k_sides ,
k = 0.5 , splinesteps = 16 , h , length , l , height , convexity = 10 , debug = false )
2020-03-29 03:41:37 +00:00
{
2020-05-21 20:47:12 +00:00
result = rounded_prism ( bottom = bottom , top = top , joint_bot = joint_bot , joint_top = joint_top , joint_sides = joint_sides ,
2020-03-29 03:41:37 +00:00
k_bot = k_bot , k_top = k_top , k_sides = k_sides , k = k , splinesteps = splinesteps , h = h , length = length , height = height , l = l , debug = debug ) ;
if ( debug ) {
2020-05-21 20:47:12 +00:00
vnf_polyhedron ( result [ 1 ] , convexity = convexity ) ;
trace_bezier_patches ( result [ 0 ] , showcps = true , splinesteps = splinesteps , $fn = 16 , showdots = false , showpatch = false ) ;
2020-03-29 03:41:37 +00:00
}
2020-05-21 20:47:12 +00:00
else vnf_polyhedron ( result , convexity = convexity ) ;
}
2020-03-29 03:41:37 +00:00
function rounded_prism ( bottom , top , joint_bot , joint_top , joint_sides , k_bot , k_top , k_sides , k = 0.5 , splinesteps = 16 ,
h , length , l , height , debug = false ) =
assert ( is_path ( bottom ) && len ( bottom ) >= 3 )
assert ( is_num ( k ) && k >= 0 && k < = 1 , "Curvature parameter k must be in interval [0,1]" )
let (
N = len ( bottom ) ,
k_top = default ( k_top , k ) ,
k_bot = default ( k_bot , k ) ,
k_sides = default ( k_sides , k ) ,
height = one_defined ( [ h , l , height , length ] , [ "height" , "length" , "l" , "h" ] , required = false ) ,
shapedimok = ( len ( bottom [ 0 ] ) = = 3 && is_path ( top , 3 ) ) || ( len ( bottom [ 0 ] ) = = 2 && ( is_undef ( top ) || is_path ( top , 2 ) ) )
)
assert ( is_num ( k_top ) && k_top >= 0 && k_top < = 1 , "Curvature parameter k_top must be in interval [0,1]" )
assert ( is_num ( k_bot ) && k_bot >= 0 && k_bot < = 1 , "Curvature parameter k_bot must be in interval [0,1]" )
assert ( shapedimok , "bottom and top must be 2d or 3d paths with the same dimension" )
assert ( len ( bottom [ 0 ] ) = = 3 || is_num ( height ) , "Must give height/length with 2d polygon input" )
let (
// Determine which points are concave by making bottom 2d if necessary
bot_proj = len ( bottom [ 0 ] ) = = 2 ? bottom : project_plane ( bottom , select ( bottom , 0 , 2 ) ) ,
bottom_sign = polygon_is_clockwise ( bot_proj ) ? 1 : - 1 ,
concave = [ for ( i = [ 0 : N - 1 ] ) bottom_sign * sign ( point_left_of_segment2d ( select ( bot_proj , i + 1 ) , select ( bot_proj , i - 1 , i ) ) ) > 0 ] ,
top = is_undef ( top ) ? path3d ( bottom , height / 2 ) :
len ( top [ 0 ] ) = = 2 ? path3d ( top , height / 2 ) :
top ,
bottom = len ( bottom [ 0 ] ) = = 2 ? path3d ( bottom , - height / 2 ) : bottom ,
jssingleok = ( is_num ( joint_sides ) && joint_sides > 0 ) || ( is_vector ( joint_sides , 2 ) && joint_sides [ 0 ] >= 0 && joint_sides [ 1 ] >= 0 ) ,
jsvecok = is_list ( joint_sides ) && len ( joint_sides ) = = N && [ ] = = [ for ( entry = joint_sides ) if ( ! ( is_num ( entry ) || is_vector ( entry , 2 ) ) ) entry ]
)
assert ( is_num ( joint_top ) || is_vector ( joint_top , 2 ) )
assert ( is_num ( joint_bot ) || is_vector ( joint_bot , 2 ) )
assert ( is_num ( joint_top ) || ( joint_top [ 0 ] >= 0 || joint_top [ 1 ] >= 0 ) , "Both entries in joint_top cannot be negative" )
assert ( is_num ( joint_bot ) || ( joint_bot [ 0 ] >= 0 || joint_bot [ 1 ] >= 0 ) , "Both entries in joint_bot cannot be negative" )
assert ( jsvecok || jssingleok ,
str ( "Argument joint_sides is invalid. All entries must be nonnegative, and it must be a number, 2-vector, or a length " , N , " list those." ) )
assert ( is_num ( k_sides ) || is_vector ( k_sides , N ) , str ( "Curvature parameter k_sides must be a number or length " , N , " vector" ) )
assert ( points_are_coplanar ( bottom ) )
assert ( points_are_coplanar ( top ) )
assert ( ! is_num ( k_sides ) || ( k_sides >= 0 && k_sides < = 1 ) , "Curvature parameter k_sides must be in interval [0,1]" )
let (
non_coplanar = [ for ( i = [ 0 : N - 1 ] ) if ( ! points_are_coplanar ( concat ( select ( top , i , i + 1 ) , select ( bottom , i , i + 1 ) ) ) ) [ i , ( i + 1 ) % N ] ] ,
k_sides_vec = is_num ( k_sides ) ? repeat ( k_sides , N ) : k_sides ,
kbad = [ for ( i = [ 0 : N - 1 ] ) if ( k_sides_vec [ i ] < 0 || k_sides_vec [ i ] > 1 ) i ] ,
2020-04-03 01:51:54 +00:00
joint_sides_vec = jssingleok ? repeat ( joint_sides , N ) : joint_sides ,
top_collinear = [ for ( i = [ 0 : N - 1 ] ) if ( points_are_collinear ( select ( top , i - 1 , i + 1 ) ) ) i ] ,
bot_collinear = [ for ( i = [ 0 : N - 1 ] ) if ( points_are_collinear ( select ( bottom , i - 1 , i + 1 ) ) ) i ]
2020-03-29 03:41:37 +00:00
)
assert ( non_coplanar = = [ ] , str ( "Side faces are non-coplanar at edges: " , non_coplanar ) )
2020-04-03 01:51:54 +00:00
assert ( top_collinear = = [ ] , str ( "Top has collinear or duplicated points at indices: " , top_collinear ) )
assert ( bot_collinear = = [ ] , str ( "Bottom has collinear or duplicated points at indices: " , bot_collinear ) )
2020-03-29 03:41:37 +00:00
assert ( kbad = = [ ] , str ( "k_sides parameter outside interval [0,1] at indices: " , kbad ) )
let (
top_patch = _rp_compute_patches ( top , bottom , joint_top , joint_sides_vec , k_top , k_sides_vec , concave ) ,
bot_patch = _rp_compute_patches ( bottom , top , joint_bot , joint_sides_vec , k_bot , k_sides_vec , concave ) ,
vertbad = [ for ( i = [ 0 : N - 1 ] )
if ( norm ( top [ i ] - top_patch [ i ] [ 4 ] [ 2 ] ) + norm ( bottom [ i ] - bot_patch [ i ] [ 4 ] [ 2 ] ) > norm ( bottom [ i ] - top [ i ] ) ) i ] ,
topbad = [ for ( i = [ 0 : N - 1 ] )
if ( norm ( top_patch [ i ] [ 2 ] [ 4 ] - top_patch [ i ] [ 2 ] [ 2 ] ) + norm ( select ( top_patch , i + 1 ) [ 2 ] [ 0 ] - select ( top_patch , i + 1 ) [ 2 ] [ 2 ] )
> norm ( top_patch [ i ] [ 2 ] [ 2 ] - select ( top_patch , i + 1 ) [ 2 ] [ 2 ] ) ) [ i , ( i + 1 ) % N ] ] ,
botbad = [ for ( i = [ 0 : N - 1 ] )
if ( norm ( bot_patch [ i ] [ 2 ] [ 4 ] - bot_patch [ i ] [ 2 ] [ 2 ] ) + norm ( select ( bot_patch , i + 1 ) [ 2 ] [ 0 ] - select ( bot_patch , i + 1 ) [ 2 ] [ 2 ] )
> norm ( bot_patch [ i ] [ 2 ] [ 2 ] - select ( bot_patch , i + 1 ) [ 2 ] [ 2 ] ) ) [ i , ( i + 1 ) % N ] ] ,
topinbad = [ for ( i = [ 0 : N - 1 ] )
if ( norm ( top_patch [ i ] [ 0 ] [ 2 ] - top_patch [ i ] [ 0 ] [ 4 ] ) + norm ( select ( top_patch , i + 1 ) [ 0 ] [ 0 ] - select ( top_patch , i + 1 ) [ 0 ] [ 2 ] )
> norm ( top_patch [ i ] [ 0 ] [ 2 ] - select ( top_patch , i + 1 ) [ 0 ] [ 2 ] ) ) [ i , ( i + 1 ) % N ] ] ,
botinbad = [ for ( i = [ 0 : N - 1 ] )
if ( norm ( bot_patch [ i ] [ 0 ] [ 2 ] - bot_patch [ i ] [ 0 ] [ 4 ] ) + norm ( select ( bot_patch , i + 1 ) [ 0 ] [ 0 ] - select ( bot_patch , i + 1 ) [ 0 ] [ 2 ] )
> norm ( bot_patch [ i ] [ 0 ] [ 2 ] - select ( bot_patch , i + 1 ) [ 0 ] [ 2 ] ) ) [ i , ( i + 1 ) % N ] ]
)
assert ( debug || vertbad = = [ ] , str ( "Top and bottom joint lengths are too large; they interfere with each other at vertices: " , vertbad ) )
assert ( debug || topbad = = [ ] , str ( "Joint lengths too large at top edges: " , topbad ) )
assert ( debug || botbad = = [ ] , str ( "Joint lengths too large at bottom edges: " , botbad ) )
assert ( debug || topinbad = = [ ] , str ( "Joint length too large on the top face at edges: " , topinbad ) )
assert ( debug || botinbad = = [ ] , str ( "Joint length too large on the bottom face at edges: " , botinbad ) )
let (
2020-05-21 20:47:12 +00:00
// Entries in the next two lists have the form [edges, vnf] where
// edges is a list [leftedge, rightedge, topedge, botedge]
top_samples = [ for ( patch = top_patch ) bezier_patch_degenerate ( patch , splinesteps , reverse = true ) ] ,
bot_samples = [ for ( patch = bot_patch ) bezier_patch_degenerate ( patch , splinesteps , reverse = false ) ] ,
leftidx = 0 ,
rightidx = 1 ,
topidx = 2 ,
botidx = 3 ,
edge_points =
2020-03-29 03:41:37 +00:00
[ for ( i = [ 0 : N - 1 ] )
2020-05-21 20:47:12 +00:00
let (
top_edge = [ top_samples [ i ] [ 0 ] [ rightidx ] , select ( top_samples , i + 1 ) [ 0 ] [ leftidx ] ] ,
bot_edge = [ select ( bot_samples , i + 1 ) [ 0 ] [ leftidx ] , bot_samples [ i ] [ 0 ] [ rightidx ] ] ,
vert_edge = [ bot_samples [ i ] [ 0 ] [ botidx ] , top_samples [ i ] [ 0 ] [ botidx ] ]
)
each [ top_edge , bot_edge , vert_edge ] ] ,
2020-03-29 03:41:37 +00:00
faces = [
2020-05-21 20:47:12 +00:00
[ for ( i = [ 0 : N - 1 ] ) each top_samples [ i ] [ 0 ] [ topidx ] ] ,
[ for ( i = [ N - 1 : - 1 : 0 ] ) each reverse ( bot_samples [ i ] [ 0 ] [ topidx ] ) ] ,
2020-03-29 03:41:37 +00:00
for ( i = [ 0 : N - 1 ] ) [
2020-05-21 20:47:12 +00:00
bot_patch [ i ] [ 4 ] [ 4 ] ,
select ( bot_patch , i + 1 ) [ 4 ] [ 0 ] ,
select ( top_patch , i + 1 ) [ 4 ] [ 0 ] ,
top_patch [ i ] [ 4 ] [ 4 ]
]
2020-03-29 03:41:37 +00:00
] ,
2020-04-03 01:51:54 +00:00
top_intersections = path_self_intersections ( faces [ 0 ] ) ,
bot_intersections = path_self_intersections ( faces [ 1 ] ) ,
2020-03-29 03:41:37 +00:00
// verify vertical edges
verify_vert =
[ for ( i = [ 0 : N - 1 ] , j = [ 0 : 4 ] )
let (
2020-05-21 20:47:12 +00:00
vline = concat ( select ( subindex ( top_patch [ i ] , j ) , 2 , 4 ) ,
select ( subindex ( bot_patch [ i ] , j ) , 2 , 4 ) )
2020-03-29 03:41:37 +00:00
)
if ( ! points_are_collinear ( vline ) ) [ i , j ] ] ,
//verify horiz edges
verify_horiz = [ for ( i = [ 0 : N - 1 ] , j = [ 0 : 4 ] )
let (
2020-05-21 20:47:12 +00:00
hline_top = concat ( select ( top_patch [ i ] [ j ] , 2 , 4 ) , select ( select ( top_patch , i + 1 ) [ j ] , 0 , 2 ) ) ,
hline_bot = concat ( select ( bot_patch [ i ] [ j ] , 2 , 4 ) , select ( select ( bot_patch , i + 1 ) [ j ] , 0 , 2 ) )
)
2020-03-29 03:41:37 +00:00
if ( ! points_are_collinear ( hline_top ) || ! points_are_collinear ( hline_bot ) ) [ i , j ] ]
2020-05-21 20:47:12 +00:00
)
2020-04-03 01:51:54 +00:00
assert ( debug || top_intersections = = [ ] ,
"Roundovers interfere with each other on top face: either input is self intersecting or top joint length is too large" )
assert ( debug || bot_intersections = = [ ] ,
"Roundovers interfere with each other on bottom face: either input is self intersecting or top joint length is too large" )
2020-03-29 03:41:37 +00:00
assert ( debug || ( verify_vert = = [ ] && verify_horiz = = [ ] ) , "Curvature continuity failed" )
2020-05-21 20:47:12 +00:00
let (
vnf = vnf_merge ( [ each subindex ( top_samples , 1 ) ,
each subindex ( bot_samples , 1 ) ,
for ( pts = edge_points ) vnf_vertex_array ( pts ) ,
vnf_triangulate ( vnf_add_faces ( EMPTY_VNF , faces ) )
] )
2020-03-29 03:41:37 +00:00
)
2020-05-21 20:47:12 +00:00
debug ? [ concat ( top_patch , bot_patch ) , vnf ] : vnf ;
// This function takes a bezier patch as input and returns [edges, vnf], where
// edges = [leftedge, rightedge, topedge, bottomedge]
// gives the points along the edges of the patch, and the vnf is the patch vnf.
// It checks for various types of degeneracy and uses half or full triangular
// sampling on degenerate patches.
function bezier_patch_degenerate ( patch , splinesteps = 16 , reverse = false ) =
assert ( is_num ( splinesteps ) , "splinesteps must be a number" )
let (
top_degen = patch [ 0 ] [ 0 ] = = select ( patch [ 0 ] , - 1 ) ,
bot_degen = select ( patch , - 1 ) [ 0 ] = = select ( select ( patch , - 1 ) , - 1 ) ,
left_degen = patch [ 0 ] [ 0 ] = = select ( patch , - 1 ) [ 0 ] ,
right_degen = select ( patch [ 0 ] , - 1 ) = = select ( select ( patch , - 1 ) , - 1 ) ,
samplepts = list_range ( splinesteps + 1 ) / splinesteps
)
top_degen && bot_degen && left_degen && right_degen ?
echo ( "fully degenerate case" )
[ repeat ( [ patch [ 0 ] [ 0 ] ] , 4 ) , EMPTY_VNF ] :
top_degen && bot_degen ?
let ( hhdf = echo ( "double degenerate (top/bot)" ) ,
pts = bezier_points ( subindex ( patch , 0 ) , samplepts )
)
[ [ pts , pts , [ pts [ 0 ] ] , [ select ( pts , - 1 ) ] ] , EMPTY_VNF ] :
left_degen && right_degen ?
let (
fda = echo ( "double degenerate (sides)" ) ,
pts = bezier_points ( patch [ 0 ] , samplepts )
)
[ [ [ pts [ 0 ] ] , [ select ( pts , - 1 ) ] , pts , pts ] , EMPTY_VNF ] :
! top_degen && ! bot_degen ?
let (
k = echo ( "non-degenerate case" ) ,
pts = bezier_patch_points ( patch , samplepts , samplepts )
)
[
[ subindex ( pts , 0 ) , subindex ( pts , len ( pts ) - 1 ) , pts [ 0 ] , select ( pts , - 1 ) ] ,
vnf_vertex_array ( pts , reverse = reverse )
] :
bot_degen ?
let (
result = bezier_patch_degenerate ( reverse ( patch ) , splinesteps = splinesteps , reverse = ! reverse )
)
[
[ reverse ( result [ 0 ] [ 0 ] ) , reverse ( result [ 0 ] [ 1 ] ) , ( result [ 0 ] [ 3 ] ) , ( result [ 0 ] [ 2 ] ) ] ,
result [ 1 ]
] :
// at this point top_degen is true
let (
full_degen = patch [ 1 ] [ 0 ] = = select ( patch [ 1 ] , - 1 ) ,
rowmax = full_degen ? list_range ( splinesteps + 1 ) :
[ for ( j = [ 0 : splinesteps ] ) j < = splinesteps / 2 ? 2 * j : splinesteps ] ,
vbb = echo ( "single degenerate case" ) ,
bpatch = [ for ( i = [ 0 : 1 : len ( patch [ 0 ] ) - 1 ] ) bezier_points ( subindex ( patch , i ) , samplepts ) ] ,
pts = [
[ bpatch [ 0 ] [ 0 ] ] ,
for ( j = [ 1 : splinesteps ] ) bezier_points ( subindex ( bpatch , j ) , list_range ( rowmax [ j ] + 1 ) / rowmax [ j ] )
] ,
vnf = vnf_tri_array ( pts , reverse = reverse )
) [
[
subindex ( pts , 0 ) ,
[ for ( row = pts ) select ( row , - 1 ) ] ,
pts [ 0 ] ,
select ( pts , - 1 ) ,
] ,
vnf
] ;
// This function produces a vnf with a triangulation for a list of rows
// where the number of points between rows differs by at most 2.
// It's a generalization of vnf_vertex_array.
function vnf_tri_array ( points , row_wrap = false , reverse = false ) =
let (
lens = [ for ( row = points ) len ( row ) ] ,
rowstarts = [ 0 , each cumsum ( lens ) ] ,
faces =
[ for ( i = [ 0 : 1 : len ( points ) - 1 - ( row_wrap ? 0 : 1 ) ] ) each
let (
rowstart = rowstarts [ i ] ,
nextrow = select ( rowstarts , i + 1 ) ,
delta = select ( lens , i + 1 ) - lens [ i ]
)
delta = = 0 ?
[ for ( j = [ 0 : 1 : lens [ i ] - 2 ] ) reverse ? [ j + rowstart + 1 , j + rowstart , j + nextrow ] : [ j + rowstart , j + rowstart + 1 , j + nextrow ] ,
for ( j = [ 0 : 1 : lens [ i ] - 2 ] ) reverse ? [ j + rowstart + 1 , j + nextrow , j + nextrow + 1 ] : [ j + rowstart + 1 , j + nextrow + 1 , j + nextrow ] ] :
delta = = 1 ?
[ for ( j = [ 0 : 1 : lens [ i ] - 2 ] ) reverse ? [ j + rowstart + 1 , j + rowstart , j + nextrow + 1 ] : [ j + rowstart , j + rowstart + 1 , j + nextrow + 1 ] ,
for ( j = [ 0 : 1 : lens [ i ] - 1 ] ) reverse ? [ j + rowstart , j + nextrow , j + nextrow + 1 ] : [ j + rowstart , j + nextrow + 1 , j + nextrow ] ] :
delta = = - 1 ?
[ for ( j = [ 0 : 1 : lens [ i ] - 3 ] ) reverse ? [ j + rowstart + 1 , j + nextrow , j + nextrow + 1 ] : [ j + rowstart + 1 , j + nextrow + 1 , j + nextrow ] ,
for ( j = [ 0 : 1 : lens [ i ] - 2 ] ) reverse ? [ j + rowstart + 1 , j + rowstart , j + nextrow ] : [ j + rowstart , j + rowstart + 1 , j + nextrow ] ] :
let ( count = floor ( ( lens [ i ] - 1 ) / 2 ) )
delta = = 2 ?
[
for ( j = [ 0 : 1 : count - 1 ] ) reverse ? [ j + rowstart + 1 , j + rowstart , j + nextrow + 1 ] : [ j + rowstart , j + rowstart + 1 , j + nextrow + 1 ] , // top triangles left
for ( j = [ count : 1 : lens [ i ] - 2 ] ) reverse ? [ j + rowstart + 1 , j + rowstart , j + nextrow + 2 ] : [ j + rowstart , j + rowstart + 1 , j + nextrow + 2 ] , // top triangles right
for ( j = [ 0 : 1 : count ] ) reverse ? [ j + rowstart , j + nextrow , j + nextrow + 1 ] : [ j + rowstart , j + nextrow + 1 , j + nextrow ] , // bot triangles left
for ( j = [ count + 1 : 1 : select ( lens , i + 1 ) - 2 ] ) reverse ? [ j + rowstart - 1 , j + nextrow , j + nextrow + 1 ] : [ j + rowstart - 1 , j + nextrow + 1 , j + nextrow ] , // bot triangles right
] :
delta = = - 2 ?
[
for ( j = [ 0 : 1 : count - 2 ] ) reverse ? [ j + nextrow , j + nextrow + 1 , j + rowstart + 1 ] : [ j + nextrow , j + rowstart + 1 , j + nextrow + 1 ] ,
for ( j = [ count - 1 : 1 : lens [ i ] - 4 ] ) reverse ? [ j + nextrow , j + nextrow + 1 , j + rowstart + 2 ] : [ j + nextrow , j + rowstart + 2 , j + nextrow + 1 ] ,
for ( j = [ 0 : 1 : count - 1 ] ) reverse ? [ j + nextrow , j + rowstart + 1 , j + rowstart ] : [ j + nextrow , j + rowstart , j + rowstart + 1 ] ,
for ( j = [ count : 1 : select ( lens , i + 1 ) ] ) reverse ? [ j + nextrow - 1 , j + rowstart + 1 , j + rowstart ] : [ j + nextrow - 1 , j + rowstart , j + rowstart + 1 ] ,
] :
assert ( false , str ( "Unsupported row length difference of " , delta , " between row " , i , " and " , i + 1 ) )
] )
[ flatten ( points ) , faces ] ;
2019-07-13 00:17:36 +00:00
2020-05-19 20:43:33 +00:00
// Converts a 2d path to a path on a cylinder at radius r
2020-05-20 04:56:09 +00:00
function _cyl_hole ( r , path ) =
2020-05-19 20:43:33 +00:00
[ for ( point = path ) cylindrical_to_xyz ( concat ( [ r ] , xscale ( 360 / ( 2 * PI * r ) , p = point ) ) ) ] ;
// Mask profile of 180 deg of a circle to round an edge
function _circle_mask ( r ) =
let ( eps = 0.1 )
fwd ( r + . 01 , p =
[
[ r + eps , 0 ] ,
each arc ( r = r , angle = [ 0 , 180 ] ) ,
[ - r - eps , 0 ] ,
[ - r - eps , r + 3 * eps ] ,
[ r + eps , r + 3 * eps ]
] ) ;
// Module: bent_cutout_mask()
// Usage: bent_cutout_mask(r|radius,thickness,path)
// Description:
// Creates a mask for cutting a round-edged hole out of a vertical cylindrical shell. The specified radius
// is the center radius of the cylindrical shell. The path needs to be sampled finely enough
// so that it can follow the curve of the cylinder. The thickness may need to be slighly oversized to
// handle the faceting of the cylinder. The path is wrapped around a cylinder, keeping the
// same dimensions that is has on the plane, with y axis mapping to the z axis and the x axis bending
// around the curve of the cylinder. The angular span of the path on the cylinder must be somewhat
// less than 180 degrees, and the path shouldn't have closely spaced points at concave points of high curvature because
2020-05-20 04:56:09 +00:00
// this will cause self-intersection in the mask polyhedron, resulting in CGAL failures.
2020-05-19 20:43:33 +00:00
// Arguments:
// r|radius = center radius of the cylindrical shell to cut a hole in
// thickness = thickness of cylindrical shell (may need to be slighly oversized)
// path = 2d path that defines the hole to cut
2020-05-20 04:56:09 +00:00
// Example: The mask as long pointed ends because this was the most efficient way to close off those ends.
2020-05-19 20:43:33 +00:00
// bent_cutout_mask(10, 1, apply(xscale(3),circle(r=3)),$fn=64);
2020-05-20 04:56:09 +00:00
// Example: An elliptical hole. Note the thickness is slightly increased to 1.05 compared to the actual thickness of 1.
// rot(-90) {
// $fn=128;
// difference(){
// cyl(r=10.5, h=10);
// cyl(r=9.5, h=11);
// bent_cutout_mask(10, 1.05, apply(xscale(3),circle(r=3)),$fn=64);
// }
2020-05-19 20:43:33 +00:00
// }
// Example: An elliptical hole in a thick cylinder
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// cyl(r=14.5, h=15);
// cyl(r=9.5, h=16);
// bent_cutout_mask(12, 5.1, apply(xscale(3),circle(r=3)));
// }
2020-05-19 20:43:33 +00:00
// }
// Example: Complex shape example
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// cyl(r=10.5, h=10, $fn=128);
// cyl(r=9.5, h=11, $fn=128);
// bent_cutout_mask(10, 1.05, apply(scale(3),supershape(step=2,m1=5, n1=0.3,n2=1.7)),$fn=32);
// }
2020-05-19 20:43:33 +00:00
// }
// Example: this shape is invalid due to self-intersections at the inner corners
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// cylinder(r=10.5, h=10,center=true);
// cylinder(r=9.5, h=11,center=true);
2020-05-21 20:47:12 +00:00
// bent_cutout_mask(10, 1.05, apply(scale(3),supershape(step=2,m1=5, n1=0.1,n2=1.7)),$fn=32);
2020-05-20 04:56:09 +00:00
// }
2020-05-19 20:43:33 +00:00
// }
// Example: increasing the step gives a valid shape, but the shape looks terrible with so few points.
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// cylinder(r=10.5, h=10,center=true);
// cylinder(r=9.5, h=11,center=true);
// bent_cutout_mask(10, 1.05, apply(scale(3),supershape(step=12,m1=5, n1=0.1,n2=1.7)),$fn=32);
// }
2020-05-19 20:43:33 +00:00
// }
2020-05-20 04:56:09 +00:00
// Example: uniform resampling produces a somewhat better result, but room remains for improvement. The lesson is that concave corners in your cutout cause trouble. To get a very good result we need to non-uniformly sample the supershape with more points at the star tips and few points at the inner corners.
// rot(-90) {
// $fn=128;
// difference(){
// cylinder(r=10.5, h=10,center=true);
// cylinder(r=9.5, h=11,center=true);
// bent_cutout_mask(10, 1.05, apply(scale(3),resample_path(supershape(step=1,m1=5, n1=0.10,n2=1.7),60,closed=true)),$fn=32);
// }
2020-05-19 20:43:33 +00:00
// }
2020-05-21 20:47:12 +00:00
// Example: The cutout spans 177 degrees. If you decrease the tube radius to 2.5 the cutout spans over 180 degrees and the model fails.
2020-05-19 20:43:33 +00:00
// r=2.6; // Don't make this much smaller or it will fail
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// tube(or=r, wall=1, h=10, anchor=CENTER);
// bent_cutout_mask(r-0.5, 1.05, apply(scale(3),supershape(step=1,m1=5, n1=0.15,n2=1.7)),$fn=32);
// }
2020-05-19 20:43:33 +00:00
// }
2020-05-20 04:56:09 +00:00
// Example: A square hole is not as simple as it seems. The model valid, but wrong, because the square didn't have enough samples to follow the curvature of the cylinder.
2020-05-19 20:43:33 +00:00
// r=25;
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// tube(or=r, wall=2, h=45);
// bent_cutout_mask(r-1, 2.1, back(5,p=square([18,18])));
// }
2020-05-19 20:43:33 +00:00
// }
// Example: Adding additional points fixed this problem
// r=25;
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// tube(or=r, wall=2, h=45);
// bent_cutout_mask(r-1, 2.1, subdivide_path(back(5,p=square([18,18])),64,closed=true));
// }
2020-05-19 20:43:33 +00:00
// }
2020-05-20 04:56:09 +00:00
// Example: Rounding just the exterior corners of this star avoids the problems we had above with concave corners of the supershape, as long as we don't oversample the star.
2020-05-19 20:43:33 +00:00
// r=25;
2020-05-20 04:56:09 +00:00
// rot(-90) {
// $fn=128;
// difference(){
// tube(or=r, wall=2, h=45);
2020-05-21 20:47:12 +00:00
// bent_cutout_mask(r-1, 2.1, apply(back(15),subdivide_path(round_corners(star(n=7,ir=5,or=10), cut=flatten(repeat([0.5,0],7))),14*15,closed=true)));
2020-05-20 04:56:09 +00:00
// }
2020-05-19 20:43:33 +00:00
// }
// Example(2D): Cutting a slot in a cylinder is tricky if you want rounded corners at the top. This slot profile has slightly angled top edges to blend into the top edge of the cylinder.
2020-05-20 04:56:09 +00:00
// function slot(slotwidth, slotheight, slotradius) = let(
// angle = 85,
// slot = round_corners(
// turtle([
// "right",
// "move", slotwidth,
// "left", angle,
// "move", 2*slotwidth,
// "right", angle,
// "move", slotheight,
// "left",
// "move", slotwidth,
// "left",
// "move", slotheight,
// "right", angle,
// "move", 2*slotwidth,
// "left", angle,
// "move", slotwidth
// ]),
2020-05-21 20:47:12 +00:00
// radius = [0,0,each repeat(slotradius,4),0,0], closed=false
2020-05-20 04:56:09 +00:00
// )
// ) apply(left(max(subindex(slot,0))/2)*fwd(min(subindex(slot,1))), slot);
2020-05-19 20:43:33 +00:00
// stroke(slot(15,29,7));
// Example: A cylindrical container with rounded edges and a rounded finger slot.
2020-05-20 04:56:09 +00:00
// function slot(slotwidth, slotheight, slotradius) = let(
// angle = 85,
// slot = round_corners(
// turtle([
// "right",
// "move", slotwidth,
// "left", angle,
// "move", 2*slotwidth,
// "right", angle,
// "move", slotheight,
// "left",
// "move", slotwidth,
// "left",
// "move", slotheight,
// "right", angle,
// "move", 2*slotwidth,
// "left", angle,
// "move", slotwidth
// ]),
2020-05-21 20:47:12 +00:00
// radius = [0,0,each repeat(slotradius,4),0,0], closed=false
2020-05-20 04:56:09 +00:00
// )
// ) apply(left(max(subindex(slot,0))/2)*fwd(min(subindex(slot,1))), slot);
// diam = 80;
// wall = 4;
// height = 40;
// rot(-90) {
// $fn=128;
// difference(){
// cyl(d=diam, rounding=wall/2, h=height, anchor=BOTTOM);
// up(wall)cyl(d=diam-2*wall, rounding1=wall, rounding2=-wall/2, h=height-wall+.01, anchor=BOTTOM);
// bent_cutout_mask(diam/2-wall/2, wall+.1, subdivide_path(apply(back(10),slot(15, 29, 7)),250));
// }
// }
2020-05-19 20:43:33 +00:00
module bent_cutout_mask ( r , thickness , path , convexity = 10 )
{
assert ( is_path ( path , 2 ) , "Input path must be a 2d path" )
assert ( r - thickness > 0 , "Thickness too large for radius" ) ;
assert ( thickness > 0 , "Thickness must be positive" ) ;
path = clockwise_polygon ( path ) ;
curvepoints = arc ( d = thickness , angle = [ - 180 , 0 ] ) ;
profiles = [ for ( pt = curvepoints ) _cyl_hole ( r + pt . x , apply ( xscale ( ( r + pt . x ) / r ) , offset ( path , delta = thickness / 2 + pt . y , check_valid = false , closed = true ) ) ) ] ;
pathx = subindex ( path , 0 ) ;
minangle = ( min ( pathx ) - thickness / 2 ) * 360 / ( 2 * PI * r ) ;
maxangle = ( max ( pathx ) + thickness / 2 ) * 360 / ( 2 * PI * r ) ;
mindist = ( r + thickness / 2 ) / cos ( ( maxangle - minangle ) / 2 ) ;
assert ( maxangle - minangle < 180 , "Cutout angle span is too large. Must be smaller than 180." ) ;
zmean = mean ( subindex ( path , 1 ) ) ;
innerzero = repeat ( [ 0 , 0 , zmean ] , len ( path ) ) ;
2020-05-20 04:56:09 +00:00
outerpt = repeat ( [ 1.5 * mindist * cos ( ( maxangle + minangle ) / 2 ) , 1.5 * mindist * sin ( ( maxangle + minangle ) / 2 ) , zmean ] , len ( path ) ) ;
2020-05-19 20:43:33 +00:00
vnf_polyhedron ( vnf_vertex_array ( [ innerzero , each profiles , outerpt ] , col_wrap = true ) , convexity = convexity ) ;
}
// vim: noexpandtab tabstop=4 shiftwidth=4 softtabstop=4 nowrap