Abstract
This paper develops a discrete methodology for approximating the so-called convex domain of a NURBS curve, namely the domain in the ambient space,
where a user-specified control point is free to move so that the curvature and torsion retains its sign along the NURBS parametric domain of definition. The methodology provides a monotonic sequence of convex polyhedra, converging from the interior to the convex domain. If the latter is non-empty, a simple algorithm is proposed, that yields a sequence of polytopes converging uniformly to the restriction of the convex domain to any user-specified bounding box. The algorithm is illustrated for a pair of planar and a spatial Bézier configuration.
where a user-specified control point is free to move so that the curvature and torsion retains its sign along the NURBS parametric domain of definition. The methodology provides a monotonic sequence of convex polyhedra, converging from the interior to the convex domain. If the latter is non-empty, a simple algorithm is proposed, that yields a sequence of polytopes converging uniformly to the restriction of the convex domain to any user-specified bounding box. The algorithm is illustrated for a pair of planar and a spatial Bézier configuration.
| Original language | English |
|---|---|
| Pages (from-to) | 117–129 |
| Number of pages | 13 |
| Journal | Computing |
| Volume | 86 |
| Issue number | 2-3 |
| Early online date | 7 Aug 2009 |
| DOIs | |
| Publication status | Published - Oct 2009 |
Keywords
- curves
- curvature
- torsion
- NURBS
- knot insertion