cgas
Version:
Xtor Compute Geometry Algorithm Libary 计算几何算法库
61 lines (50 loc) • 2.34 kB
text/typescript
import { ArrayEx } from "../data/ArrayEx";
import { Vec3 } from '../../math/Vec3';
import { sign, gPrecision } from '../../math/Math';
import { Orientation } from '../data/type';
import { Line } from './Line';
/**
* 线段正反原则:右手坐标系中,所在平面为XZ平面,把指向方向看着负Z轴,x正为正方向,x负为负方向
*/
export class Polyline extends ArrayEx {
isCoPlanar: boolean;
constructor(vs: any[] = [], public normal: Vec3 = Vec3.UnitY) {
super();
Object.setPrototypeOf(this, Polyline.prototype);
this.push(...vs);
this.isCoPlanar = true;
}
/**
* 偏移
* @param {Number} distance 偏移距离
* @param {Vector3} normal 折线所在平面法线
*/
offset(distance: number, normal: Vec3 = this.normal) {
return new Polyline(this);
}
/**
* 圆角 将折线拐点圆角化
* @param {Number} useDistance 圆角段距离
* @param {Number} segments 分切割段数
*/
corner(useDistance: number, segments = 3, normal = this.normal, threshold = 0.1): Polyline {
var polyline: Polyline = new Polyline();
for (let i = 0; i < this.length - 2; i++) {
const p0: Vec3 = this[i];
const p1: Vec3 = this[i + 1];
const p2: Vec3 = this[i + 2];
polyline.push(p0);
var fixedPoint0 = p0.distanceTo(p1) <= useDistance * 2 ? p0.clone().add(p1).multiplyScalar(0.5) : p0.clone().sub(p1).normalize().multiplyScalar(useDistance).add(p1);
var fixedPoint1 = p2.distanceTo(p1) <= useDistance * 2 ? p2.clone().add(p1).multiplyScalar(0.5) : p2.clone().sub(p1).normalize().multiplyScalar(useDistance).add(p1);
polyline.push(fixedPoint0);
var binormal0 = p1.clone().sub(p0).applyAxisAngle(normal, Math.PI / 2);
var binormal1 = p1.clone().sub(p0).applyAxisAngle(normal, Math.PI / 2);
//计算圆弧点
var line0 = new Line(fixedPoint0, binormal0.add(fixedPoint0));
var line1 = new Line(fixedPoint1, binormal1.add(fixedPoint1));
var center = line0.distanceLine(line1).closests[0];//圆心
polyline.push(fixedPoint1);
}
return polyline;
}
}