|
[1]Christoph M. Hoffmann and Ching-Shoei Chiang, “Variable-Radius Circles in Cluster Merging, Part I: Translational Clusters”, Computer-Aided Design 34(11), Pages 787-797, 2002. (SCI)。國科會補助: NSC-39201F [2]Christoph M. Hoffmann and Ching-Shoei Chiang, “Variable-Radius Circles in Cluster Merging, Part II, Rotational Clusters”, Computer-Aided Design 34(11), Pages 799-805, 2002. (SCI)。國科會補助: NSC-39201F [3]Ching-Shoei Chiang and Robert Joan-Arinyo, “Revisiting variable radius circles in Constructive Geometric Constraint Solving”, Computer Aided Geometric Design vol.21 Issue 4, Pages: 371 - 399, April 2004. [4]Fudos 1., “Constraint Solving for Computer Aided Design”, Purdue University, Ph.D. thesis, 1995. [5]Muirhead, F.R. , “On the number and nature of the solutions of the Apollonian contact problem”, Proceedings of the Edinburgh Mathematical Society 14, p. 135-147, 1896. [6]Bruen, A., Fisher, J.C., Wilker, J.B., “Apollonius by Inversion”, Mathematics Magazine, Vol. 56, No.2, 1983. [7]Bouma, W., Fudos, I., Hoffmann, C.M., Cai , J. and Paige, R., “A Geometric Constraint Solver”, Computer-Aided Design 27(6), 487-501, 1995. [8]Allner, J., Krasauskas, R. and Pottmann, H. , “Error propagation in geometric constructions”, Computer-Aided Design, Vol 32, No. 11, p631-641, 2000. [9]Hoffmann C.M. and Vermeer, P., “Geometric constraint solving in R2 and R3”, Computing in Euclidean Geometry, World Scientific Publishing, 1995. [10]Cassiano Durand and C.M. Hoffmann, “A systematic framework for Solving Geometric Constraints Analytically”, Journal Symbolic Computation, Vol. 30, p493-519, 2000. [11]Trott, M. “Apollonius Spheres”, Mathematica in Education and Research, Vol.6, No. 1, p.21-23, 1997. [12]Sottile, F. and Theobald, T., “Lines tangent to 2n-2 spheres in R3”, Trans. Amer. Math. Soc. 354:4815-4829, 2002. [13]Hoffmann C.M. and Yuan, Bo, “On Spatial Constraint Solving Approaches”, Workshop for Automatic Deductions in Geometry, ETH Zurich, 2000. [14]C. Durand. “Symbolic and Numerical Techniques for Constraint Solving”, Purdue University, Dept. of Comp. SCI., PhD thesis, 1998. [15]Ching-Shoei Chiang, “The Geometric Constraint Solving Problem Using Cyclographic Maps,” Technique Report Soochow University Taipei, Taiwan, ROC, Computer and Information Science, 2001. [16]http://mathworld.wolfram.com/Point-LineDistance3-Dimensional.html [17]Edward Angel, Interactive Computer Graphics. Page 156 ~ 160, third edition, Addison Wesley. [18]Christoph M. Hoffmann and Bo Yuan, “There 12 Common Tangents to Four Spheres.” Computer Science Department Purdue University West Lafayette, in 47907 USA, October 18, 2000. [19]I. G. Macdonald, J. Pach and T. Theobald, “Common Tangents to Four Unit Balls in R3”, Discrete Comput. Geom., 26:1-17, 2001. [20]I. Fudos and C.M. Hoffmann. “A graph-constructive approach to solving systems of geometric constraints.”, ACM Trans on Graphics, 16:179-216, 1997. [21]C.M. Hoffmann, A. Lomonosov, and M. Sitharam. “Geometric constraint decomposition. In Geometric Constraint Solving and applications”, pages 170-195, New York, Springer Verlag, 1998. [22]Christoph M. Hoffmann, Ching-Shoei Chiang, Bo Yuan. “Elementary Constructions in Spatial Constraint Solving.” Computer Science, Purdue University. [23]Christoph M. Hoffmann and Cassiano Durand. “Variational Constraints in 3D.” Proc. Intl Conf on Shape Modeling and Appl, Aizu, Japan, 1999; 90-97. [24]Paul Bourke, http://astronomy.swin.edu.au/~pbourke/geometry/2circle/, 1997.
|