grey/BOSL2
1
0
Fork 0
mirror of https://github.com/BelfrySCAD/BOSL2.git synced 2024-12-29 16:29:40 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Minor tweaks

Browse source
This commit is contained in:
RonaldoCMP 2021-06-23 16:24:59 +01:00
parent d90e22e4ca
commit dcae838b82
1 changed files with 7 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
geometry.scad
View file

@ -1110,7 +1110,7 @@ function plane_offset(plane) =
// } // }
function projection_on_plane(plane, points) = function projection_on_plane(plane, points) =
assert( _valid_plane(plane), "Invalid plane." ) assert( _valid_plane(plane), "Invalid plane." )
assert( is_path(points), "Invalid list of points or dimension." ) assert( is_matrix(points,undef,3), "Invalid list of points or dimension." )
let( let(
p = len(points[0])==2 p = len(points[0])==2
? [for(pi=points) point3d(pi) ] ? [for(pi=points) point3d(pi) ]
@ -1752,6 +1752,7 @@ function circle_line_intersection(c,r,d,line,bounded=false,eps=EPSILON) =
function noncollinear_triple(points,error=true,eps=EPSILON) = function noncollinear_triple(points,error=true,eps=EPSILON) =
assert( is_path(points), "Invalid input points." ) assert( is_path(points), "Invalid input points." )
assert( is_finite(eps) && (eps>=0), "The tolerance should be a non-negative value." ) assert( is_finite(eps) && (eps>=0), "The tolerance should be a non-negative value." )
len(pts)<3 ? [] :
let( let(
pa = points[0], pa = points[0],
b = furthest_point(pa, points), b = furthest_point(pa, points),
@ -2092,6 +2093,7 @@ function polygon_is_clockwise(poly) =
// Usage: // Usage:
// newpoly = clockwise_polygon(poly); // newpoly = clockwise_polygon(poly);
// Topics: Geometry, Polygons, Clockwise // Topics: Geometry, Polygons, Clockwise
// See Also: polygon_is_clockwise(), ccw_polygon(), reverse_polygon()
// Description: // Description:
// Given a 2D polygon path, returns the clockwise winding version of that path. // Given a 2D polygon path, returns the clockwise winding version of that path.
// Arguments: // Arguments:
@ -2104,6 +2106,7 @@ function clockwise_polygon(poly) =
// Function: ccw_polygon() // Function: ccw_polygon()
// Usage: // Usage:
// newpoly = ccw_polygon(poly); // newpoly = ccw_polygon(poly);
// See Also: polygon_is_clockwise(), clockwise_polygon(), reverse_polygon()
// Topics: Geometry, Polygons, Clockwise // Topics: Geometry, Polygons, Clockwise
// Description: // Description:
// Given a 2D polygon poly, returns the counter-clockwise winding version of that poly. // Given a 2D polygon poly, returns the counter-clockwise winding version of that poly.
@ -2118,6 +2121,7 @@ function ccw_polygon(poly) =
// Usage: // Usage:
// newpoly = reverse_polygon(poly) // newpoly = reverse_polygon(poly)
// Topics: Geometry, Polygons, Clockwise // Topics: Geometry, Polygons, Clockwise
// See Also: polygon_is_clockwise(), ccw_polygon(), clockwise_polygon()
// Description: // Description:
// Reverses a polygon's winding direction, while still using the same start point. // Reverses a polygon's winding direction, while still using the same start point.
// Arguments: // Arguments:
@ -2369,7 +2373,7 @@ function is_convex_polygon(poly,eps=EPSILON) =
// echo(convex_distance(sphr1[0], sphr3[0])); // Returns: 0.5 // echo(convex_distance(sphr1[0], sphr3[0])); // Returns: 0.5
function convex_distance(points1, points2, eps=EPSILON) = function convex_distance(points1, points2, eps=EPSILON) =
assert(is_matrix(points1) && is_matrix(points2,undef,len(points1[0])), assert(is_matrix(points1) && is_matrix(points2,undef,len(points1[0])),
"The input list should be a consistent non empty list of points of same dimension.") "The input lists should be compatible consistent non empty lists of points.")
assert(len(points1[0])==2 || len(points1[0])==3 , assert(len(points1[0])==2 || len(points1[0])==3 ,
"The input points should be 2d or 3d points.") "The input points should be 2d or 3d points.")
let( d = points1[0]-points2[0] ) let( d = points1[0]-points2[0] )
@ -2431,7 +2435,7 @@ function _GJK_distance(points1, points2, eps=EPSILON, lbd, d, simplex=[]) =
// //
function convex_collision(points1, points2, eps=EPSILON) = function convex_collision(points1, points2, eps=EPSILON) =
assert(is_matrix(points1) && is_matrix(points2,undef,len(points1[0])), assert(is_matrix(points1) && is_matrix(points2,undef,len(points1[0])),
"The input list should be a consistent non empty list of points of same dimension.") "The input lists should be compatible consistent non empty lists of points.")
assert(len(points1[0])==2 || len(points1[0])==3 , assert(len(points1[0])==2 || len(points1[0])==3 ,
"The input points should be 2d or 3d points.") "The input points should be 2d or 3d points.")
let( d = points1[0]-points2[0] ) let( d = points1[0]-points2[0] )