Approximating Centroids for the Maximum Intersection of Spherical Polygons

References

• Barker, S.-M., Towards a topology for computational geometry, Computer-Aided Design, Vol. 27, No. 4, 1995, pp 311–318.
   Google Scholar
• Baumgart, B.-G., A polyhedron representation for computer vision, In National Computer Conference, Anaheim, CA, IFIPS, 1975, pp 589–596.
   Google Scholar
• Chen, L.-L., Chou, S.-Y. and Woo, T.-C., Separating and intersecting spherical polygons: computing machinability on three-four- and five-axis numerically controlled machines, ACM Tr. on Graphics, Vol. 12, No. 14, 1993, pp 305–326.
   Google Scholar
• Chen, L.-L., Chou, S.-Y. and Woo, T.-C., Paring directions for mould and die design, Computer-Aided Design, 25(12), 1993, pp 762–768.
   Web of Science ®Google Scholar
• Chen, L.-L. and Woo, T.-C., Computational geometry on the sphere with application to automated machining, Tr. ASME, J. Mechanical Design, Vol. 114, 1992, pp 288–295.
   Web of Science ®Google Scholar
• Dyer, M.-E., Linear time algorithms for two- and three-variable linear programs, SIAM J. Computing, Vol. 13, No. 1, 1984, pp 31–45.
   Web of Science ®Google Scholar
• Elber, G., IRIT User’s Manual, 1996.
   Google Scholar
• Erickson, J. and Honda, H., The implementation of the smallest enclosing sphere, Source Code.
   Google Scholar
• Ha, J.-S. and Shin, S.-Y., Edge advancing rules for intersecting spherical convex polygons, International Journal of Computational Geometry and Applications, Vol. 12, No. 3, 2002, pp 207–216.
   Google Scholar
• Hoffmann, C.-M., The problems of accuracy and robustness in geometric computation, Computer, Vol. 22, No. 3, 1989, pp 31–41.
   Google Scholar
• Hohmeyer, M.-E., The implementation of linear programming, Source Code.
   Google Scholar
• Hu, C.-Y., Patikalakis, N.-M. and Ye, X., Robust interval solid modeling part I: representations, Computer-Aided Design, Vol. 28, No. 10, 1996, pp 807–817.
   Web of Science ®Google Scholar
• Gan, J.-G., Woo, T.-C. and Tang, K., Spherical maps: their construction, properties, and approximation, ASME J. Mechanical Design, Vol. 116, 1994, pp 357–363.
   Web of Science ®Google Scholar
• Graham, R.-L., An efficient algorithm for determining the convex hull of finite planar set, Information Processing Letters, Vol. 1, 1972, pp 132–133.
   Google Scholar
• Gupta, P. et al., Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining, Computer-Aided Design, Vol. 28, No. 8, 1996, pp 577–587.
   Web of Science ®Google Scholar
• Megiddo, N., Linear-time algorithms for linear programming in and related problems, In Proc. 23rd Annual IEEE Sym. Found. Comput. Sci., 1982, pp 329–338.
   Google Scholar
• Megiddo, N., Linear programming in linear time when the dimension is fixed, J. ACM, Vol. 31, No. 1, 1984, pp 114–127.
   Google Scholar
• O’Rourke, J., Chien, C.-B., Olson, T. and Naddor, D., A new linear algorithm for intersecting convex polygons, Computer Graphics and Image Processing, Vol. 19, 1982, pp 384–391.
   Google Scholar
• Seidel, R., Small-dimensional linear programming and convex hulls made easy, Discrete and Computational Geometry, 1991, pp 423–434.
   Google Scholar
• Shamos, M.-I. and Hoey, D., Geometric intersection problems, Seventeenth Annual IEEE Symposium on Foundation of Computer Science, 1976, pp 208–215.
   Google Scholar
• Suh, S.-H. and Kang, J.-K., Process planning for multi-axis NC machining of free surfaces, Int. J. Prod. Res., Vol. 33, No. 10, 1995, pp 2723–2738.
   Web of Science ®Google Scholar
• Tang, K., Woo, T. and Gan, J., Maximum intersection of spherical polygons and workpiece orientation for 4- and 5-axis machining, ASME J. Mechanical Design, Vol. 114, 1992, pp 477–485.
   Web of Science ®Google Scholar
• Tangelder, J.-W.-H., Automated fabrication of shape models of free-form objects with a sculpturing robot, Ph. D. Thesis, Industrial Design Engineering of Delft Univ. of Technology, 1998.
   Google Scholar
• Toussaint, G.-T., A simple linear algorithm for intersecting convex polygons, The Visual Computer, Vol. 1, 1985, pp 118–123.
   Google Scholar
• Weiler, K., Edge-based data structures for solid modeling in curved-surface environments, IEEE Computer Graphics and Application, Vol. 5, No. 1, 1985, pp 21–40.
   Web of Science ®Google Scholar
• Welzl, E., Smallest enclosing disks (balls and ellipsoids), New Results and New Trends in Computer Science, Springer Lecture Notes in Computer Science, Vol. 555, 1991, pp 359–370.
   Google Scholar
• Woo, T.-C., A combinatorial analysis of boundary data structure schema, IEEE Comput. Graph. Appl., Vol. 5, No. 3, 1985, pp 19–27.
   Google Scholar
• Woo, T.-C., Visibility maps and spherical algorithms, Computer Aided Design, Vol. 26, No. 1, 1994, pp 6–16.
   Web of Science ®Google Scholar