Sufficiently Fat Polyhedra are Not 2-Castable
暂无分享,去创建一个
[1] Prosenjit Gupta,et al. Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design , 1999, Comput. Geom..
[2] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[3] Prosenjit Bose,et al. Determining the Castability of Simple Polyhedra , 1997, Algorithmica.
[4] Avraam Isayev,et al. Injection and Compression Molding Fundamentals , 1987 .
[5] Prosenjit Gupta,et al. Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design , 1996, Comput. Geom..
[6] S. Griffis. EDITOR , 1997, Journal of Navigation.
[7] R. Elliott. Cast iron technology , 1988 .