On mapping Bezier curve and surface subdivision algorithms into a hypercube with geometric adjacency constraint
暂无分享,去创建一个
[1] Ralph Duncan,et al. A survey of parallel computer architectures , 1990, Computer.
[2] D. Scott,et al. Minimal mesh embeddings in binary hypercubes , 1988, IEEE Trans. Computers.
[3] Ten-Hwang Lai,et al. Mapping Pyramid Algorithms into Hypercubes , 1990, J. Parallel Distributed Comput..
[4] Jean Vuillemin,et al. A data structure for manipulating priority queues , 1978, CACM.
[5] Sanjay V. Rajopadhye,et al. Mapping Divide-and-Conquer Algorithms to Parallel Architectures , 1990, ICPP.
[6] Tse-yun Feng,et al. A Survey of Interconnection Networks , 1981, Computer.
[7] Tony DeRose,et al. The Triangle: a Multiprocessor Architecture for Fast Curve and Surface Generation. , 1987 .
[8] Alan S. Wagner. Embedding Arbitrary Binary Trees in a Hypercube , 1989, J. Parallel Distributed Comput..
[9] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[10] Fuhua Cheng,et al. Bezier Curve Generator: A Hardware Approach to Curve Generation , 1985 .
[11] Richard F. Riesenfeld,et al. A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.