1 |
N. Megiddo, “Linear programming in linear time when the dimension is fixed,” Journal of ACM, vol. 31, no. 1, 1984, pp. 114-127.
DOI
|
2 |
M. Dyer, “Linear time algorithms for two- and three-variable linear programs,” SIAM. Journal on Computing, vol. 13, no. 1, 1984, pp. 31-45.
DOI
|
3 |
R. Seidel, “Small-dimensional linear programming and convex hulls made easy,” Discrete Computing Geometry, vol. 6, no. 5, 1991, pp. 423-434.
DOI
|
4 |
T. Woo, “Visibility maps and spherical algorithms,” Computer Aided Design, vol. 26, no. 1, 1994, pp. 6-16.
DOI
|
5 |
G. Toussaint, “Computing largest empty circles with location constraints,” International Journal of Computer and Information Sciences, vol. 12, no. 5, 1983, pp. 347-358.
DOI
|
6 |
J. G. Gan, T. C. Woo, and K. Tang, “Spherical maps: their construction, properties, and approximation,” ASME J. Mechanical Design, vol. 116, 1994, pp. 357-363.
DOI
|
7 |
N. Capens, an implementation of [6], http://www.flipcode.com/archives/smallest enclosing spheres.shtml
|
8 |
CGAL, an implementation of [6], http://www.cgal.org/manual/latest/dochtml/cgalmanual/bounding volumes ref/class min _sphere of spheres d.html.
|
9 |
M. Hohmeyer, an implementation of [9], http://www3.cs.stonybrook.edu/-algorith/implement/linprog/distrib/source.a.
|
10 |
CGAL, an implementation of [9], http://www.cgal.org/manual/latest/doc html/cgal manual/qp solver/chapter main.html.
|
11 |
J. Ha and K. Yoo, “Characterization of polyhedron monotonicity,” Computer-Aided Design, vol. 38, no. 1, 2006, pp. 48-54.
DOI
|
12 |
J. Ha and K. Yoo, “Approximating centroids for the maximum intersection of spherical polygons,” Computer-Aided Design, vol. 37, no. 8, 2005, pp. 783-790.
DOI
|
13 |
G. Toussaint, Computational Geometry, Elsevier Science, 1985.
|
14 |
S. C. L. L. Chen and T. Woo, “Separating and intersecting spherical polygons: computing machinability on three- four- and five-axis numerically controlled machines,” ACM Tr. on Graphics, vol. 12, no. 4, 1993, pp. 305-326.
DOI
|
15 |
Lin-Lin Chen, Shuo-Yan Chou, and Tony C. Woo, “Parting directions for mould and die design,” Computer-Aided Design, vol. 25, no. 12, 1993, pp. 762-768.
DOI
|
16 |
E. Welzel, "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.
|