| [1] Green P, Sibson R. Computing dirichlet tessellations in theplane. The Computer Journal, 1978, 21(2): 168-173.[2] Brown K Q. Voronoi diagrams from convex hulls. Informa-tion Processing Letters, 1979, 9(5): 223-228.[3] Aurenhammer F. Gewichtete Voronoi diagramme: Ge-ometrische deutung und Konstruktions-Algorithmen [Ph.D.Thesis]. IIG-TU Graz, Austria, 1984.[4] Aurenhammer F, Klein R. Voronoi diagrams. In Handbookof Computational Geometry, Chapter V, Sack J, Urrutia G(eds.), Elsevier Science Publishing, 2000, pp.201-290.[5] Guibas L J, Knuth D E, Sharir M. Randomized incrementalconstruction of Delaunay and Voronoi diagrams. In Proc. the17th International Colloquium on Automata, Languages andProgramming, July 1990, pp.414-431.[6] Okabe A, Boots B, Sugihara K. Spatial Tessellations: Con-cepts and Applications of Voronoi Diagrams. John Wiley andSons, 1992.[7] Kim D S, Cho Y, Kim D. Euclidean Voronoi diagram of 3Dballs and its computation via tracing edges. Computer-AidedDesign, 2005, 37(13): 1412-1424.[8] Kim D, Kim D S. Region-expansion for the Voronoi diagramof 3D spheres. Comput. Aided Des., 2006, 38(5): 417-430.[9] Ryu J, Kim D, Cho Y, Park R, Kim D S. Computa-tion of molecular surface using Euclidean Voronoi diagram.Computer-Aided Design and Applications, 2005, 2(1/4).[10] Kim D S, Cho Y, Kim D, Kim S, Bhak J, Lee S H. EuclideanVoronoi diagrams of 3D spheres and applications to proteinstructure analysis. Japan Journal of Industrial and AppliedMathematics, 2005, 22(2): 251-265.[11] Will H M. Fast and efficient computation of additivelyweighted Voronoi cells for applications in molecular biology.In Proc. the 6th Scandinavian Workshop on Algorithm The-ory, July 1998, pp.310-321.[12] Gavrilova M. Proximity and applications in general metrics[Ph.D. Thesis]. University of Calgary, Alberta, Canada, 1998.[13] Gavrilova M, Rokne J. Updating the topology of the dynamicVoronoi diagram for spheres in Euclidean d-dimensionalspace. Comput. Aided Geom. Des., 2003, 20(4): 231-242.[14] Gavrilova M. An explicit solution for computing the verticesof the Euclidean d-dimensional Voronoi diagram of spheres ina 皁ating-point arithmetic. International Journal of Compu-tational Geometry and Applications, 2009, 19(5): 415-424.[15] Wu W T, Gao X S. Automated reasoning and equation solv-ing with the characteristic set method. J. Comput. Sci. &Technol., 2006, 21(5): 756-764.[16] Nishida T, Sugihara K. Precision necessary for d-dimensionalsphere Voronoi diagrams. In Proc. the 5th InternationalSymposium on Voronoi Diagrams in Science and Engineer-ing, September 2008, pp.157-167.[17] Nishida T, Tanaka Y, Sugihara K. Evaluation of the precisionfor exact computation of a circle Voronoi diagram. TechnicalReport UW-CS-TR-1481, Department of Mathematical Infor-matics, Graduate School of Information Science and Technol-ogy, The University of Tokyo, Japan, October 2007.[18] Kim D S, Cho Y, Kim D. Calculating three-dimensional (3D)Voronoi diagrams. Patent No. US7825927, 2010.[19] Hanniel I, Elber G. Computing the Voronoi cells of planes,spheres and cylinders in R3. Comput. Aided Geom. Des.,2009, 26(6): 695-710.[20] Anton F. Voronoi diagrams of semi-algebraic sets [Ph.D. The-sis]. The University of British Columbia, Vancouver, Canada,2004.[21] Anton F. A certified Delaunay graph con癷ct locator for semi-algebraic sets. In Proc. Int. Conf. Computational Scienceand Its Applications, Part I, May 2005, pp.669-682.[22] Kim D S, Kim D, Cho Y, Sugihara K. Quasi-triangulationand interworld data structure in three dimensions. Computer-aided Design, 2006, 38(7): 808-819.[23] Kim D S, Cho Y, Sugihara K. Quasi-worlds and quasi-operators on quasi-triangulations. Comput. Aided Des.,2010, 42(10): 874-888.[24] Anton F, Mioc D, Gold C. The Voronoi diagram of circles andits application to the visualization of the growth of particles.In Transactions on Computational Science III, Gavrilova M,Tan C J (eds.), Berlin, Heidelberg: Springer, 2009, pp.20-54.[25] Kolmogorov A. A statistical theory for the recrystallizationof metals. Akad. nauk SSSR, Izv., Ser. Matem., 1937, (3):355-359.[26] Deschamps A. Handbook of Aluminum, New York, USA:Marcel Dekker, Inc., 2005, pp.155-192.[27] Chen Z, Xu J. Robust algorithm for k-gon Voronoi diagramconstruction. In Proc. the 14th Canadian Conference onComputational Geometry, August 2002, pp.77-81.[28] Blum L, Cucker F, Shub M, Smale S. Complexity and RealComputation. New York: Springer-Verlag, 1997.[29] Canny J F, Emiris I Z. A subdivision-based algorithm for thesparse resultant. J. ACM, 2000, 47(3): 417-451.[30] Voronoï G F. Nouvelles applications des paramètres conti-nus à la théorie des formes quadratiques. Premier mémoire.sur quelques propriétés des formes quadratiques positives par-faites. Journal für die reine und angewandte Mathematik,1908, 1908(133): 97-178. (In French)[31] Voronoï G F. Nouvelles applications des paramètres conti-nus à la théorie des formes quadratiques. deuxième mémoire.recherches sur les paralléloèdres primitifs. première partie.partition uniforme de l'espace analytique à n dimensions àl'aide des translations d'un m^eme polyèdre convexe. Journalfür die reine und angewandte Mathematik, 1908, 1908(134):198-287. (In French)[32] Voronoï G F. Nouvelles applications des paramètres conti-nus à la théorie des formes quadratiques. deuxième mémoire.recherches sur les paralléloèdres primitifs. seconde partie. do-maines de formes quadratiques correspondant aux différentstypes de paralléloèdres primitifs. Journal für die reineund angewandte Mathematik, 1909, 1909(136): 67-182. (InFrench)[33] Greuel G M, Pfister G. A Singular Introduction to Commu-tative Algebra. Berlin: Springer-Verlag, 2002.[34] Hamelryck T. An amino acid has two sides: A new 2D mea-sure provides a different view of solvent exposure. Proteins:Structure, Function, and Bioinformatics, 2005, 59(1): 38-48. |