Dylan/excalidraw
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

split linear segments as curves

Browse Source
This commit is contained in:
Preet 2023-10-23 21:29:53 -07:00
parent bf7c91536f
commit 7f5b7bab69
1 changed files with 47 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
src/scene/Shape.ts
View File

@ -235,27 +235,38 @@ export const _generateElementShape = (
// curve is always the first element
// this simplifies finding the curve for an element
const splits = element.segmentSplitIndices || [];
if (!element.roundness) {
if (splits.length === 0) {
if (options.fill) {
shape = [generator.polygon(points as [number, number][], options)];
} else {
shape = [generator.linearPath(points as [number, number][], options)];
shape = [
generator.linearPath(points as [number, number][], options),
];
}
} else {
const pointList: Point[][] = [];
const splits = element.segmentSplitIndices || [];
let currentIndex = 0;
for (const index of splits) {
const slice = points.slice(currentIndex, index + 1);
if (slice.length) {
pointList.push([...slice]);
const splitInverse: number[] = [];
const splitSet = new Set(splits);
for (let i = 0; i < points.length; i++) {
if (!splitSet.has(i)) {
splitInverse.push(i);
}
currentIndex = index;
}
if (currentIndex < points.length - 1) {
pointList.push(points.slice(currentIndex));
shape = [
generator.curve(
computeMultipleCurvesFromSplits(points, splitInverse),
options,
),
];
}
shape = [generator.curve(pointList as [number, number][][], options)];
} else {
shape = [
generator.curve(
computeMultipleCurvesFromSplits(points, splits),
options,
),
];
}
// add lines only in arrow
@ -392,3 +403,22 @@ export const _generateElementShape = (
}
}
};
const computeMultipleCurvesFromSplits = (
points: readonly Point[],
splits: readonly number[],
): [number, number][][] => {
const pointList: Point[][] = [];
let currentIndex = 0;
for (const index of splits) {
const slice = points.slice(currentIndex, index + 1);
if (slice.length) {
pointList.push([...slice]);
}
currentIndex = index;
}
if (currentIndex < points.length - 1) {
pointList.push(points.slice(currentIndex));
}
return pointList as [number, number][][];
};