openscad/dotSCAD
1
0
Fork 0
mirror of https://github.com/JustinSDK/dotSCAD.git synced 2025-08-07 07:16:36 +02:00
Code Issues Releases Wiki Activity

circularable

Browse Source
This commit is contained in:
Justin Lin
2019-09-02 15:05:44 +08:00
parent 9f1276d232
commit dce3d0018b
1 changed files with 63 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

95
examples/square_maze.scad
View File

@@ -74,10 +74,25 @@ function rand_dirs() =
][round(rands(0, 24, 1)[0])]; ][round(rands(0, 24, 1)[0])];
// get x value by dir // get x value by dir
function next_x(x, dir) = x + [1, 0, -1, 0][dir]; function next_x(x, dir, columns, circular) =
let(nx = x + [1, 0, -1, 0][dir])
circular ?
nx < 1 ? nx + columns : (
nx > columns ? nx % columns : nx
)
:
nx;
// get y value by dir // get y value by dir
function next_y(y, dir) = y + [0, 1, 0, -1][dir]; function next_y(y, dir, rows, circular) =
let(ny = y + [0, 1, 0, -1][dir])
circular ?
ny < 1 ? ny + rows : (
ny > rows ? ny % rows : ny
)
:
ny;
// go right and carve the right wall // go right and carve the right wall
function go_right_from(x, y, maze) = [ function go_right_from(x, y, maze) = [
for(b = maze) [get_x(b), get_y(b)] == [x, y] ? ( for(b = maze) [get_x(b), get_y(b)] == [x, y] ? (
@@ -99,20 +114,29 @@ function go_up_from(x, y, maze) = [
]; ];
// go left and carve the right wall of the left block // go left and carve the right wall of the left block
function go_left_from(x, y, maze) = [ function go_left_from(x, y, maze, rows) =
for(b = maze) [get_x(b), get_y(b)] == [x - 1, y] ? ( let(
get_wall_type(b) == UPPER_RIGHT_WALL ? x_minus_one = x - 1,
[x - 1, y, UPPER_WALL, visited(x - 1, y, maze)] : nx = x_minus_one < 1 ? x_minus_one + rows : x_minus_one
[x - 1, y, NO_WALL, visited(x - 1, y, maze)] )
) : b [
]; for(b = maze) [get_x(b), get_y(b)] == [nx, y] ? (
get_wall_type(b) == UPPER_RIGHT_WALL ?
[nx, y, UPPER_WALL, visited(nx, y, maze)] :
[nx, y, NO_WALL, visited(nx, y, maze)]
) : b
];
// go down and carve the upper wall of the down block // go down and carve the upper wall of the down block
function go_down_from(x, y, maze) = [ function go_down_from(x, y, maze, rows) = [
for(b = maze) [get_x(b), get_y(b)] == [x, y - 1] ? ( let(
y_minus_one = y - 1,
ny = y_minus_one < 1 ? y_minus_one + rows : y_minus_one
)
for(b = maze) [get_x(b), get_y(b)] == [x, ny] ? (
get_wall_type(b) == UPPER_RIGHT_WALL ? get_wall_type(b) == UPPER_RIGHT_WALL ?
[x, y - 1, RIGHT_WALL, visited(x, y - 1, maze)] : [x, ny, RIGHT_WALL, visited(x, ny, maze)] :
[x, y - 1, NO_WALL, visited(x, y - 1, maze)] [x, ny, NO_WALL, visited(x, ny, maze)]
) : b ) : b
]; ];
@@ -120,52 +144,55 @@ function go_down_from(x, y, maze) = [
function try_block(dir, x, y, maze, rows, columns) = function try_block(dir, x, y, maze, rows, columns) =
dir == 0 ? go_right_from(x, y, maze) : ( dir == 0 ? go_right_from(x, y, maze) : (
dir == 1 ? go_up_from(x, y, maze) : ( dir == 1 ? go_up_from(x, y, maze) : (
dir == 2 ? go_left_from(x, y, maze) : dir == 2 ? go_left_from(x, y, maze, rows) :
go_down_from(x, y, maze) // dir is 3 go_down_from(x, y, maze, rows) // dir is 3
) )
); );
// find out visitable dirs from (x, y) // find out visitable dirs from (x, y)
function visitable_dirs_from(x, y, maze, rows, columns) = [ function visitable_dirs_from(x, y, maze, rows, columns, x_circular, y_circular) = [
for(dir = [0, 1, 2, 3]) for(dir = [0, 1, 2, 3])
if(visitable(next_x(x, dir), next_y(y, dir), maze, rows, columns)) if(visitable(next_x(x, dir, columns, x_circular), next_y(y, dir, rows, y_circular), maze, rows, columns))
dir dir
]; ];
// go maze from (x, y) // go maze from (x, y)
function go_maze(x, y, maze, rows, columns) = function go_maze(x, y, maze, rows, columns, x_circular = false, y_circular = false) =
// have visitable dirs? // have visitable dirs?
len(visitable_dirs_from(x, y, maze, rows, columns)) == 0 ? len(visitable_dirs_from(x, y, maze, rows, columns, x_circular, y_circular)) == 0 ?
set_visited(x, y, maze) // road closed set_visited(x, y, maze) // road closed
: walk_around_from( : walk_around_from(
x, y, x, y,
rand_dirs(), rand_dirs(),
set_visited(x, y, maze), set_visited(x, y, maze),
rows, columns rows, columns,
x_circular, y_circular
); );
// try four directions // try four directions
function walk_around_from(x, y, dirs, maze, rows, columns, i = 4) = function walk_around_from(x, y, dirs, maze, rows, columns, x_circular, y_circular, i = 4) =
// all done? // all done?
i > 0 ? i > 0 ?
// not yet // not yet
walk_around_from(x, y, dirs, walk_around_from(x, y, dirs,
// try one direction // try one direction
try_routes_from(x, y, dirs[4 - i], maze, rows, columns), try_routes_from(x, y, dirs[4 - i], maze, rows, columns, x_circular, y_circular),
, rows, columns, rows, columns,
x_circular, y_circular,
i - 1) i - 1)
: maze; : maze;
function try_routes_from(x, y, dir, maze, rows, columns) = function try_routes_from(x, y, dir, maze, rows, columns, x_circular, y_circular) =
// is the dir visitable? // is the dir visitable?
visitable(next_x(x, dir), next_y(y, dir), maze, rows, columns) ? visitable(next_x(x, dir, columns, x_circular), next_y(y, dir, rows, y_circular), maze, rows, columns) ?
// try the block // try the block
go_maze( go_maze(
next_x(x, dir), next_y(y, dir), next_x(x, dir, columns, x_circular), next_y(y, dir, rows, y_circular),
try_block(dir, x, y, maze, rows, columns), try_block(dir, x, y, maze, rows, columns),
rows, columns rows, columns,
x_circular, y_circular
) )
// road closed so return maze directly // road closed so return maze directly
: maze; : maze;
@@ -187,7 +214,7 @@ module draw_block(wall_type, block_width, wall_thickness) {
} }
} }
module draw_maze(rows, columns, blocks, block_width, wall_thickness) { module draw_maze(rows, columns, blocks, block_width, wall_thickness, x_circular = false, y_circular = false) {
for(block = blocks) { for(block = blocks) {
// move a block to a right position. // move a block to a right position.
translate([get_x(block) - 1, get_y(block) - 1] * block_width) translate([get_x(block) - 1, get_y(block) - 1] * block_width)
@@ -198,8 +225,12 @@ module draw_maze(rows, columns, blocks, block_width, wall_thickness) {
); );
} }
// the lowermost wall
line2d([0, 0], [block_width * columns, 0], wall_thickness);
// the leftmost wall // the leftmost wall
line2d([0, 0], [0, block_width * rows], wall_thickness); if(!x_circular) {
line2d([0, 0], [0, block_width * rows], wall_thickness);
}
// the lowermost wall
if(!y_circular) {
line2d([0, 0], [block_width * columns, 0], wall_thickness);
}
} }