Set Membership Classification: A Unified Approach to Geometric Intersection Problems
暂无分享,去创建一个
[1] George Finlay Simmons,et al. Introduction to Topology and Modern Analysis , 1963 .
[2] R. Nagel,et al. 3-D Visual simulation , 1971 .
[3] Chris I. Yessios,et al. An efficient algorithm for finding the union, intersection and differences of spatial domains , 1972 .
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] Ivan E. Sutherland,et al. Reentrant polygon clipping , 1974, Commun. ACM.
[6] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[7] Michael Ian Shamos,et al. Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[8] Tien Chi Chen,et al. Storage Management Operations in Linked Uniform Shift Register Loops , 1976, IBM J. Res. Dev..
[9] Chak-Kuen Wong,et al. The Generation of Permutations in Magnetic Bubble Memories , 1976, IEEE Transactions on Computers.
[10] Werner E. Kluge,et al. Traversing Binary TreeStructures withShift-Register Memories , 1977 .
[11] Aristides A. G. Requicha,et al. Geometric Modeling of Mechanical Parts and Processes , 1977, Computer.
[12] Peter R. Atherton,et al. Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.
[13] Aristides A. G. Requicha,et al. Mathematical Foundations of Constructive Solid Geometry: General Topology of Closed Regular Sets , 1978 .
[14] Aristides A. G. Requicha,et al. The PADL-1.0/2 system for defining and displaying solid objects , 1978, SIGGRAPH.