4 ms·
Oh hey this might solve a problem I’ve been working on, to resample connected strands of Bézier curve segments, by splitting and merging the individual segments
by dahart 6y ago
Oh hey this might solve a problem I’ve been working on, to resample connected strands of Bézier curve segments, by splitting and merging the individual segments.
Raph, do you maintain any kind of full path parameter through this process, and if so are there any gotchas or tricks? Are there even any choices you can make? I’m not sure, and I’m asking before thinking about it carefully, so that might be a dumb question. I’m just wondering out loud what happens when merging two segments of different lengths and whether there are any ways to try to preserve roughly the same path parameterization as before merging.
Probably because I’m not very familiar with the prior work, I’m not sure I followed where the area metric came from. Is fitting area a popular way to do this in the prior work, or a recent development, or is that your own new finding?
- raphlinus 6y agoAs far as I know, I'm the first to propose a solution that includes the equal-area constraint as part of the solution, though it is mentioned in the Penner paper as part of the search that led to the saddle point ODF solutions. The technique should definitely work for path merging, that's a primary motivation. I'm not sure I understand your other questions. It'll probably be clearer when I release some code that implements this algorithm, though I'm not making any promises when that might be.