Abstract
We present algorithms for computing the kernel of a closed freeform rational surface. The kernel computation is reformulated as a problem of finding the zero-sets of polynomial equations; using these zero-sets we characterize developable surface patches and planar patches that belong to the boundary of the kernel. Using a plane-point duality, this paper also explores a duality relationship between the kernel of a closed surface and the convex hull of its tangential surface.
Original language | English |
---|---|
Pages (from-to) | 129-142 |
Number of pages | 14 |
Journal | International Journal of Shape Modeling |
Volume | 12 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2006 Dec |
Externally published | Yes |
Keywords
- B-spline
- Convex hull
- Freeform rational surface
- Gamma-kernel
- Kernel
- Symbolic computation
- Zero-set finding
ASJC Scopus subject areas
- Software
- Modelling and Simulation
- Computer Vision and Pattern Recognition
- Computer Science Applications
- Geometry and Topology
- Applied Mathematics