Determination of the minimum bounding box of an arbitrary solid: an iterative approach
暂无分享,去创建一个
[1] Andrew S. Glassner,et al. An introduction to ray tracing , 1989 .
[2] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.
[3] Georges M. Fadel,et al. Accuracy issues in CAD to RP translations , 1996 .
[4] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[5] James Arvo,et al. A survey of ray tracing acceleration techniques , 1989 .
[6] David F. Rogers,et al. Mathematical elements for computer graphics , 1976 .
[7] Frans C. A. Groen,et al. The smallest box around a package , 1981, Pattern Recognit..
[8] Sariel Har-Peled,et al. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions , 1999, SODA '99.
[9] Luigi Ciminiera,et al. Computing CSG-tree boundaries as algebraic expressions , 1994, Comput. Aided Des..
[10] Ralph R. Martin,et al. Putting objects into boxes , 1988 .
[11] Jami J. Shah,et al. Automatic bar stock selection for machining , 1994 .
[12] Kok-Lim Low,et al. Computing bounding volume hierarchies using model simplification , 1999, SI3D.
[13] Yonghua Chen,et al. Determining parting direction based on minimum bounding box and fuzzy logics , 1997 .