Trimmed-surface algorithms for the evaluation and interrogation of solid boundary representations
IBM Journal of Research and Development
ACM Transactions on Graphics (TOG)
Functional composition algorithms via blossoming
ACM Transactions on Graphics (TOG)
Computing a chain of blossoms, with application to products of splines
Computer Aided Geometric Design
An optimal algorithm for expanding the composition of polynomials
ACM Transactions on Graphics (TOG)
Curve reconstruction from unorganized points
Computer Aided Geometric Design
An improved Hoschek intrinsic parametrization
Computer Aided Geometric Design
Computer Aided Geometric Design
Fitting B-spline curves to point clouds by curvature-based squared distance minimization
ACM Transactions on Graphics (TOG)
Constrained curve fitting on manifolds
Computer-Aided Design
Approximate computation of curves on B-spline surfaces
Computer-Aided Design
ACM SIGGRAPH 2008 papers
A rational extension of Piegl's method for filling n-sided holes
Computer-Aided Design
Hausdorff and minimal distances between parametric freeforms in R2and R3
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
Optimal parameterizations of bézier surfaces
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
G1 continuous approximate curves on NURBS surfaces
Computer-Aided Design
Weak visibility polygons of NURBS curves inside simple polygons
Journal of Computational and Applied Mathematics
Equiareal parameterizations of NURBS surfaces
Graphical Models
Hi-index | 0.00 |
Curves on surfaces play an important role in computer aided geometric design. In this paper, we present a hyperbola approximation method based on the quadratic reparameterization of Bezier surfaces, which generates reasonable low degree curves lying completely on the surfaces by using iso-parameter curves of the reparameterized surfaces. The Hausdorff distance between the projected curve and the original curve is controlled under the user-specified distance tolerance. The projected curve is @e"T-G^1 continuous, where @e"T is the user-specified angle tolerance. Examples are given to show the performance of our algorithm.