References
- Cho, Y., Kim, J.-K., Ryu, J., Won, C.-I., Kim, C.-M., Kim, D., and Kim, D.-S., BetaMol : a molecular modeling, analysis and visualization software based on the betacomplex and the quasi-triangulation, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012, Vol. 6, No. 3, pp. 389-403. https://doi.org/10.1299/jamdsm.6.389
- Emiris, I.Z. and Karavelas, M.I.. The predicates of the Apollonius diagram : Algorithmic analysis and implementation, Computational Geometry-Theory and Applications, 2006, Vol. 33, pp. 18-57. https://doi.org/10.1016/j.comgeo.2004.02.006
- Fortune, S., A sweepline algorithm for Voronoi diagrams, Algorithmica, 1987, Vol. 2, pp. 153-174. https://doi.org/10.1007/BF01840357
- Kim, D., Cho, C.-H., Cho, Y., Ryu, J., Bhak, J., and Kim, D.-S., Pocket extraction on proteins via the Voronoi diagram of spheres, Journal of Molecular Graphics & Modelling, 2008, Vol. 26, No. 7, pp. 1104-1112. https://doi.org/10.1016/j.jmgm.2007.10.002
- Kim, D.-S. Kim, D., Cho, Y., and Sugihara, K., Quasitriangulation and interworld data structure in three dimensions, Computer-Aided Design, 2006, Vol. 38, No. 7, pp. 808-819. https://doi.org/10.1016/j.cad.2006.04.008
- Kim, D.-S., Kim, D., and Sugihara, K., Voronoi diagram of a circle set from Voronoi diagram of a point set : I. topology, Computer Aided Geometric Design, 2001, Vol. 18, pp. 541-562. https://doi.org/10.1016/S0167-8396(01)00050-4
- Kim, D.-S., Kim, D., and Sugihara, K., Voronoi diagram of a circle set from Voronoi diagram of a point set : II. geometry, Computer Aided Geometric Design, 2001, Vol. 18, pp. 563-585. https://doi.org/10.1016/S0167-8396(01)00051-6
- Kim, D.-S., Yu, K., Cho, Y., Kim, D., and Yap, C., Shortest paths for disc obstacles, Proceedings of the International Conference on Computational Science and Its Applications-ICCSA2004, Lecture Notes in Computer Science, 2004, Vol. 3045, pp. 62-70.
- Kim, J.-K. Cho, Y., Laskowski, R.A., Ryu, S.E. Sugihara, K., and Kim, D.-S., BetaVoid : molecular voids via betacomplexes and Voronoi diagrams, Proteins : Structure, Functions, and Bioinformatics, 2014, Vol. 82, No. 9, pp. 1829-1849. https://doi.org/10.1002/prot.24537
- Lee, D. and Drysdale, R., Generalization of Voronoi diagrams in the plane, SIAM Journal on Computing, 1981, Vol. 10, No. 1, pp. 73-87. https://doi.org/10.1137/0210006
- Lee, M., Sugihara, K., and Kim, D.-S., Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks, ACM Transactions on Mathematical Software, 2016, Vol. 43, No. 2, pp. 14:1-14:23.
- Sharir, M., Intersection and closest-pair problems for a set of planar discs, SIAM Journal on Computing, 1985, Vol. 14, No. 2, pp. 448-468. https://doi.org/10.1137/0214034
- Sugihara, K. and Iri, M., A robust topology-oriented incremental algorithm for Voronoi diagrams, International Journal of Computational Geometry & Applications, 1994, Vol. 4, No. 2, pp. 179-228. https://doi.org/10.1142/S0218195994000124
- Sugihara, K., Sawai, M., Sano, H., Kim, D.-S., and Kim, D., Disk packing for the estimation of the size of a wire bundle, Japan Journal of Industrial and Applied Mathematics, 2004, Vol. 21, No. 3, pp. 259-278. https://doi.org/10.1007/BF03167582
- Yap, C.-K., An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete & Computational Geometry, 1987, Vol. 2, pp. 365-393. https://doi.org/10.1007/BF02187890