Filling Polyhedral Molds
暂无分享,去创建一个
[1] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[2] K. C. Hui,et al. Mould design with sweep operations - a heuristic search approach , 1992, Comput. Aided Des..
[3] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[4] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..
[5] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..
[6] David P. Dobkin,et al. The Complexity of Linear Programming , 1980, Theor. Comput. Sci..
[7] Micha Sharir,et al. Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..
[8] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[9] Bernard Chazelle,et al. Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[10] Eric L. Buckleitner,et al. Molds for Reaction Injection, Structural Foam and Expandable Styrene Molding , 1987 .
[11] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .