Search for the Intersection Polygon of any Two Polygons: Application to the Garment Industry
暂无分享,去创建一个
[1] Ivan E. Sutherland,et al. Reentrant polygon clipping , 1974, Commun. ACM.
[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[3] Thomas Ottmann,et al. The Complexity of Manipulating Hierarchically Defined Sets of Rectangles , 1981, MFCS.
[4] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Kurt Mehlhorn,et al. Multi-dimensional searching and computational geometry , 1984 .
[6] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[7] Eugene W. Myers. An O(E log E + I) Expected Time Algorithm for the Planar Segment Intersection Problem , 1985, SIAM J. Comput..
[8] J. E. Glynn,et al. Numerical Recipes: The Art of Scientific Computing , 1989 .
[9] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.
[10] Rae A. Earnshaw,et al. Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.
[11] James E. Vastyan,et al. Computer graphics: A programming approach , 1983 .
[12] Michael Ian Shamos,et al. Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[13] David P. Dobkin,et al. Computational Geometry — Then and Now , 1988 .
[14] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[15] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[16] Franco P. Preparata,et al. Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.
[17] Peter R. Atherton,et al. Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.