Computer algebra (2nd ed.): systems and algorithms for algebraic computation
Computer algebra (2nd ed.): systems and algorithms for algebraic computation
The NURBS book
Handbook of Geometric Programming Using Open Geometry GL
Handbook of Geometric Programming Using Open Geometry GL
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
Envelope computation in the plane by approximate implicitization
Applicable Algebra in Engineering, Communication and Computing
| Hi-index | 0.00 |
Given a planar curve s(t), the locus of those points from which the curve can be seen under a fixed angle is called isoptic curve of s(t). Isoptics are well-known and widely studied, especially for some classical curves such as e.g. conics (Loria, 1911). They can theoretically be computed for a large class of parametric curves by the help of their support functions or by direct computation based on the definition, but unfortunately these computations are extremely complicated even for simple curves. Our purpose is to describe the isoptics of those curves which are still frequently used in geometric modeling - the Bezier curves. It turns out that for low degree Bezier curves the direct computation is possible, but already for degree 4 or 5 the formulas are getting too complicated even for computer algebra systems. Thus we provide a new way to solve the problem, proving some geometric relations of the curve and their isoptics, and computing the isoptics as the envelope of envelopes of families of isoptic circles over the chords of the curve.