De Casteljau's algorithm on manifolds
From MaRDI portal
Publication:2443068
DOI10.1016/j.cagd.2013.06.002zbMath1286.65023WikidataQ125576496 ScholiaQ125576496MaRDI QIDQ2443068
Publication date: 4 April 2014
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2013.06.002
symmetric spaces; Riemannian manifold; ruled surface; Lie group; rigid body motion; positive definite matrix; Bézier curve; curve design; nonlinear subdivision; canal surface; Euclidean group; De Casteljau's algorithm
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
Hermite Interpolation and Data Processing Errors on Riemannian Matrix Manifolds, Apollonian de Casteljau-type algorithms for complex rational Bézier curves, Sasaki metric for spline models of manifold-valued trajectories, What do `convexities' imply on Hadamard manifolds?, A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds, Differentiable Piecewise-Bézier Surfaces on Riemannian Manifolds, 7 Manifold interpolation
Cites Work
- Subdivision schemes for positive definite matrices
- Convergence and smoothness analysis of subdivision rules in Riemannian and symmetric spaces
- Smoothness equivalence properties of univariate subdivision schemes and their projection analogues
- The De Casteljau algorithm on Lie groups and spheres
- A two-step algorithm of smooth spline generation on Riemannian manifolds
- Convergence and \(C^1\) analysis of subdivision schemes on manifolds by proximity
- On Donoho’s Log-Exp Subdivision Scheme: Choice of Retraction and Time-Symmetry
- A General Proximity Analysis of Nonlinear Subdivision Schemes
- Smoothness Equivalence Properties of General Manifold-Valued Data Subdivision Schemes
- Smoothness Properties of Lie Group Subdivision Schemes
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Convergence of refinement schemes on metric spaces
- Multiscale Representations for Manifold-Valued Data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
