A projective invariant generalization of the de Casteljau algorithm
✍ Scribed by J. Benítez
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 404 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
✦ Synopsis
a b s t r a c t
A projective invariant generalization of the de Casteljau algorithm is described by using the cross ratio and an auxiliary line. We describe the implicit form of the section conics obtained by the algorithm proposed in this paper. Finally, we show how to construct specific conic sections using this approach.
📜 SIMILAR VOLUMES
A b s t r a c t , A generalized Dirac equation is presented as a model theory of disturbed Lorentz invariance. The physical properties of this model and experimental consequences are discussed. A program its described how such Lorentz noninvariant equations may be produced by cosmologicel induction
In this paper we propose algorithms for generation of frequent item sets by successive construction of the nodes of a lexicographic tree of item sets. We discuss different strategies in generation and traversal of the lexicographic tree such as breadth-first search, depth-first search, or a combinat