Sciweavers

SAC
2010
ACM

Constraint-based LN-curves

14 years 7 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with such additional geometric constraints. We use a family of curves with linearly varying normals, LN curves, over the parameter interval [0, u]. The nonlinear equations that arise can be of algebraic degree 60. We solve them using the GPU on commodity graphics cards and achieve interactive performance. The family of curves considered has the additional property that the convolution of two curves in the family is again a curve in the family, assuming common Gauss maps, making the class more useful to applications. We also remark on the larger class of LN curves and how it relates to B´ezier curves. Keywords Geometric constraints, LN-curves, MCAD, CAGD, GPU programming, convolution.
Young Joon Ahn, Christoph M. Hoffmann
Added 17 May 2010
Updated 17 May 2010
Type Conference
Year 2010
Where SAC
Authors Young Joon Ahn, Christoph M. Hoffmann
Comments (0)