贝塞尔剪辑 [英] Bezier clipping

问题描述

我试图找到/制作的算法来计算任意两个充满2D对象的交叉点（新填充的对象）。对象正在使用线或立方济耶定义，并且可具有孔或自相交。我所知道的一些现有的算法做相同的多边形，此处上市。不过，我想支持贝济耶没有细分成多边形，输出应该有大致相同的控制点作为输入的地方有没有交叉点。

I'm trying to find/make an algorithm to compute the intersection (a new filled object) of two arbitrary filled 2D objects. The objects are defined using either lines or cubic beziers and may have holes or self-intersect. I'm aware of several existing algorithms doing the same with polygons, listed here. However, I'd like to support beziers without subdividing them into polygons, and the output should have roughly the same control points as the input in areas where there are no intersections.

这是一个交互式程序做一些南玻但裁剪并不需要是实时的。我搜索了一段时间，但还没有找到很好的出发点。

This is for an interactive program to do some CSG but the clipping doesn't need to be real-time. I've searched for a while but haven't found good starting points.

推荐答案

我发现下面的发布是最好的信息有关贝塞尔剪辑：

I found the following publication to be the best of information regarding Bezier Clipping:

T。 W. Sederberg，杨百翰大学，计算机辅助几何设计课程笔记

T. W. Sederberg, BYU, Computer Aided Geometric Design Course Notes

第七章，讨论曲线交点可在网上。它概述了4种不同的方法来寻找交叉点，并介绍贝塞尔裁剪细节：

Chapter 7 that talks about Curve Intersection is available online. It outlines 4 different approaches to find intersections and describes Bezier Clipping in detail:

<一个href="http://www.tsplines.com/technology/edu/CurveIntersection.pdf">http://www.tsplines.com/technology/edu/CurveIntersection.pdf

这篇关于贝塞尔剪辑的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！