openscad/dotSCAD
1
0
Fork 0
mirror of https://github.com/JustinSDK/dotSCAD.git synced 2025-08-30 09:49:59 +02:00
Code Issues Releases Wiki Activity

refactor deps

Browse Source
This commit is contained in:
Justin Lin
2020-01-27 11:46:01 +08:00
parent 275ec843d3
commit 53106fe963
2 changed files with 58 additions and 53 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
src/_impl/_bijection_offset_impl.scad Normal file
View File

@@ -0,0 +1,56 @@
use <__comm__/__lines_from.scad>;
use <__comm__/__line_intersection.scad>;
function _bijection_inward_edge_normal(edge) =
let(
pt1 = edge[0],
pt2 = edge[1],
dx = pt2[0] - pt1[0],
dy = pt2[1] - pt1[1],
edge_leng = norm([dx, dy])
)
[-dy / edge_leng, dx / edge_leng];
function _bijection_outward_edge_normal(edge) = -1 * _bijection_inward_edge_normal(edge);
function _bijection_offset_edge(edge, dx, dy) =
let(
pt1 = edge[0],
pt2 = edge[1],
dxy = [dx, dy]
)
[pt1 + dxy, pt2 + dxy];
function _bijection__bijection_offset_edges(edges, d) =
[
for(edge = edges)
let(
ow_normal = _bijection_outward_edge_normal(edge),
dx = ow_normal[0] * d,
dy = ow_normal[1] * d
)
_bijection_offset_edge(edge, dx, dy)
];
function _bijection_offset_impl(pts, d, epsilon) =
let(
es = __lines_from(pts, true),
offset_es = _bijection__bijection_offset_edges(es, d),
leng = len(offset_es),
leng_minus_one = leng - 1,
last_p = __line_intersection(offset_es[leng_minus_one], offset_es[0], epsilon)
)
concat(
last_p != [] && last_p == last_p ? [last_p] : [],
[
for(i = 0; i < leng_minus_one; i = i + 1)
let(
this_edge = offset_es[i],
next_edge = offset_es[i + 1],
p = __line_intersection(this_edge, next_edge, epsilon)
)
// p == p to avoid [nan, nan], because [nan, nan] != [nan, nan]
if(p != [] && p == p) p
]
);

55
src/bijection_offset.scad
View File

@@ -8,59 +8,8 @@
* *
**/ **/
include <__comm__/__lines_from.scad>; use <_impl/_bijection_offset_impl.scad>;
include <__comm__/__line_intersection.scad>;
function _bijection_inward_edge_normal(edge) =
let(
pt1 = edge[0],
pt2 = edge[1],
dx = pt2[0] - pt1[0],
dy = pt2[1] - pt1[1],
edge_leng = norm([dx, dy])
)
[-dy / edge_leng, dx / edge_leng];
function _bijection_outward_edge_normal(edge) = -1 * _bijection_inward_edge_normal(edge);
function _bijection_offset_edge(edge, dx, dy) =
let(
pt1 = edge[0],
pt2 = edge[1],
dxy = [dx, dy]
)
[pt1 + dxy, pt2 + dxy];
function _bijection__bijection_offset_edges(edges, d) =
[
for(edge = edges)
let(
ow_normal = _bijection_outward_edge_normal(edge),
dx = ow_normal[0] * d,
dy = ow_normal[1] * d
)
_bijection_offset_edge(edge, dx, dy)
];
function bijection_offset(pts, d, epsilon = 0.0001) = function bijection_offset(pts, d, epsilon = 0.0001) =
let( _bijection_offset_impl(pts, d, epsilon);
es = __lines_from(pts, true),
offset_es = _bijection__bijection_offset_edges(es, d),
leng = len(offset_es),
leng_minus_one = leng - 1,
last_p = __line_intersection(offset_es[leng_minus_one], offset_es[0], epsilon)
)
concat(
last_p != [] && last_p == last_p ? [last_p] : [],
[
for(i = 0; i < leng_minus_one; i = i + 1)
let(
this_edge = offset_es[i],
next_edge = offset_es[i + 1],
p = __line_intersection(this_edge, next_edge, epsilon)
)
// p == p to avoid [nan, nan], because [nan, nan] != [nan, nan]
if(p != [] && p == p) p
]
);