Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΈ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π‘ΠΠΠ‘ Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌ ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ
ΠΠ»Ρ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΠΎΠ³ΠΎ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΏΠ΅ΡΠ΅ΡΠΈΡΠ»Π΅Π½Π½ΡΡ ΠΏΡΠΎΠ±Π»Π΅ΠΌ Π² Π½Π°ΡΡΠΎΡΡΠ΅ΠΉ ΡΠ°Π±ΠΎΡΠ΅ ΠΏΡΠ΅Π΄Π»Π°Π³Π°Π΅ΡΡΡ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ, ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΡΡ Π½Π° Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌΠ°Ρ ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ. ΠΠ»Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌΠΎΠΉ ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ (ΠΠ) Π΄Π»Ρ ΡΠΎΡΠ΅ΡΠ½ΡΡ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² Π½Π°Π·ΡΠ²Π°Π΅ΡΡΡ ΡΠ°Π·Π±ΠΈΠ΅Π½ΠΈΠ΅ ΠΏΠ»ΠΎΡΠΊΠΎΡΡΠΈ Π½Π° ΡΡΠ΅ΠΉΠΊΠΈ, ΠΊΠ°ΠΆΠ΄Π°Ρ ΠΈΠ· ΠΊΠΎΡΠΎΡΡΡ Π΅ΡΡΡ Π»ΠΎΠΊΡΡ ΡΠΎΡΠ΅ΠΊ, ΡΠ°ΡΠΏΠΎΠ»ΠΎΠΆΠ΅Π½Π½ΡΡ Π±Π»ΠΈΠΆΠ΅ ΠΊ ΠΎΠ΄Π½ΠΎΠΌΡ ΠΈΠ· ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² Π² ΠΌΠ΅ΡΡΠΈΠΊΠ΅ ΠΠ²ΠΊΠ»ΠΈΠ΄Π°, ΡΠ΅ΠΌ ΠΊ ΠΎΡΡΠ°Π»ΡΠ½ΡΠΌ. ΠΠ·Π²Π΅ΡΡΠ½Ρ ΠΌΠΎΠ΄ΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ Π΄Π°Π½Π½ΠΎΠ³ΠΎ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ: Π΄Π»Ρ… Π§ΠΈΡΠ°ΡΡ Π΅ΡΡ >
Π‘ΠΏΠΈΡΠΎΠΊ Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΡ
- ΠΠ°Π·ΡΠ½ΠΎΠ² Π. Π., Π©Π΅ΠΌΠ΅Π»ΠΈΠ½ΠΈΠ½ Π. Π. ΠΠ²ΡΠΎΠΌΠ°ΡΠΈΠ·Π°ΡΠΈΡ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΠΠ‘: Π 6-ΡΠΈ ΠΊΠ½. ΠΠ½. 4: Π’ΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ΅ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π½Π΅ΡΠ΅Π³ΡΠ»ΡΡΠ½ΡΡ ΠΠΠ‘. Π.: ΠΡΡΡΠ°Ρ ΡΠΊΠΎΠ»Π°.-1990.-110 Ρ.
- ΠΠ΅Π»Π»ΠΈ ΠΠΆ. ΠΠ±ΡΠ°Ρ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡ: ΠΠ΅Ρ. Ρ Π°Π½Π³Π». 2-Π΅ ΠΈΠ·Π΄. — Π.: ΠΠ°ΡΠΊΠ°, 1981. -432 Ρ.
- ΠΠ°ΡΠ»ΠΎ Π. ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡ ΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½Π°Ρ Π³ΡΠ°ΡΠΈΠΊΠ° Π½Π° Π‘++: ΠΠ΅Ρ. Ρ Π°Π½Π³Π». Π.: «ΠΠ·Π΄Π°ΡΠ΅Π»ΡΡΡΠ²ΠΎ ΠΠΠΠΠ», 1997. — 304 Π΅.
- ΠΠ°Π»ΠΈΠ½Π°ΡΡΠΊΠ°Ρ Π. Π, ΠΠΎΠΆΡΡ ΠΎΠ² Π. Π., Π Π΅Π²ΡΠΊΠΈΠ½ A.M. ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΠΏΠΎΠΈΡΠΊΠ° ΠΊΡΠ°ΡΡΠ°ΠΉΡΠΈΡ ΠΏΡΡΠ΅ΠΉ Π² Π³ΡΠ°ΡΠ΅. // ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡ: ΡΡΡΠ΄Ρ ΠΏΡΡΠ½Π°Π΄ΡΠ°ΡΡΡ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΡ ΡΡΠ΅Π½ΠΈΠΉ Π ΠΠ‘Π£ (28−31 ΡΠ½Π²Π°ΡΡ 2006 Π³ΠΎΠ΄Π°). Π.: ΠΠ·Π΄-Π²ΠΎ Π ΠΠ‘Π£, 2006. — Π‘. 147−167.
- ΠΠ°Π»ΠΈΠ½Π°ΡΡΠΊΠ°Ρ Π.Π. ΠΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΎΠ΅ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΠ΅ Π°Π±ΡΡΡΠ°ΠΊΡΠ½ΡΡ Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌ ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ. // Π€ΡΠ½Π΄Π°ΠΌΠ΅Π½ΡΠ°Π»ΡΠ½Π°Ρ ΠΈ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°, 2007, ΡΠΎΠΌ 13, № 2. -Π‘.141−154.
- ΠΠ°Π»ΠΈΠ½Π°ΡΡΠΊΠ°Ρ Π.Π. ΠΠ±Π·ΠΎΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΏΠΎΠΈΡΠΊΠ° ΠΊΡΠ°ΡΡΠ°ΠΉΡΠΈΡ ΠΏΡΡΠ΅ΠΉ Π² Π·Π°Π΄Π°ΡΠ°Ρ ΡΠΆΠ°ΡΠΈΡ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΠΈ ΠΠ‘. // ΠΠ·Π²Π΅ΡΡΠΈΡ Π²ΡΠ·ΠΎΠ². ΠΠ»Π΅ΠΊΡΡΠΎΠ½ΠΈΠΊΠ°, 2006, № 6. Π‘. 36−55.
- ΠΠ°Π»ΠΈΠ½Π°ΡΡΠΊΠ°Ρ Π.Π. Π‘ΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½Π°Ρ Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌΠ° ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ Π΄Π»Ρ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π³ΡΠ°ΡΠ° ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠΉ Π² Π·Π°Π΄Π°ΡΠ°Ρ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π‘ΠΠΠ‘. // ΠΠ·Π²Π΅ΡΡΠΈΡ Π²ΡΠ·ΠΎΠ². ΠΠ»Π΅ΠΊΡΡΠΎΠ½ΠΈΠΊΠ°, 2007, № 3. Π‘. 24−31.
- ΠΡΠ΅ΠΏΠ°ΡΠ°ΡΠ° Π€., Π¨Π΅ΠΉΠΌΠΎΡ Π. ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡ: ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅. Π.: ΠΠΈΡ, 1989.-478 Ρ.
- Π‘Π΅Π»ΡΡΠΈΠ½ Π.Π. ΠΠ²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠ΅ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΠΈ ΠΠΠ‘. -Π.: Π Π°Π΄ΠΈΠΎ ΠΈ ΡΠ²ΡΠ·Ρ. 1983. — 112 Ρ.
- Π‘ΠΎΡΠ½ΠΈΠΊΠΎΠ² Π.Π. Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΡΠΆΠ°ΡΠΈΡ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΡΡ ΡΡΠ΅Π΅ΠΊ ΡΡΠ±ΠΌΠΈΠΊΡΠΎΠ½Π½ΡΡ Π‘ΠΠΠ‘: ΠΠΈΡΡ. ΠΊΠ°Π½Π΄. ΡΠ΅Ρ Π½. Π½Π°ΡΠΊ. ΠΠΠ «ΠΠΎΡΠΎΡΠΎΠ»Π° ΠΠΠ», ΠΠΎΡΠΊΠ²Π°, 2004. 119 Ρ.
- Π’ΠΎΠΌΠ°Ρ Π€., ΠΠ²Π°Π½ΠΎΠ² Π. Π‘ΠΠΠ ΠΌΠΈΠΊΡΠΎΡΠ»Π΅ΠΊΡΡΠΎΠ½ΠΈΠΊΠΈ. ΠΡΠ°ΠΏΡ Π±ΠΎΠ»ΡΡΠΎΠ³ΠΎ ΠΏΡΡΠΈ. // ΠΠ»Π΅ΠΊΡΡΠΎΠ½ΠΈΠΊΠ°: Π½Π°ΡΠΊΠ°, ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΡ Π±ΠΈΠ·Π½Π΅Ρ, № 3'2006. 2006. — Π‘. 82−85.
- Π¨Π΅ΠΏΠ΅Π»Π΅Π² Π.Π., Π‘ΡΠ΅ΠΌΠΏΠΊΠΎΠ²ΡΠΊΠΈΠΉ A.JI. ΠΡΠ³Π°Π½ΠΈΠ·Π°ΡΠΈΡ ΡΠΈΡΡΠ΅ΠΌΠ½ΠΎΠΉ ΡΡΠ΅Π΄Ρ Π΄Π»Ρ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΎΡΠΊΡΡΡΡΡ Π‘ΠΠΠ Π‘ΠΠΠ‘. Π.: ΠΠΠΠ’. — 1999. — 116 Ρ.
- Π€ΠΎΠΊΡ Π., ΠΡΠ°ΡΡ Π. ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡ. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ Π² ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΠΈ ΠΈ Π½Π° ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠ²Π΅: ΠΏΠ΅Ρ. Ρ Π°Π½Π³Π». Π.: ΠΠΈΡ. — 1982. — 304 Ρ.
- Π©Π΅ΠΌΠ΅Π»ΠΈΠ½ΠΈΠ½ Π.Π. ΠΠ²ΡΠΎΠΌΠ°ΡΠΈΠ·Π°ΡΠΈΡ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ. Π.: ΠΠΠΠ’.-2001.- 132 Ρ.
- Aichholzer Π., Aurenhammer F. Voronoi diagrams computational geometry’s favorite // Special issue of Foundations of Information Processing of TELEMATIK. — 2002. — Vol. 1. — P. 7−11.
- Aurenhammer F., Klein R. Voronoi diagrams. // In J. Sack and G. Urrutia, editors, Handbook of Computational Geometry, Chapter V. Elsevier Science Publishing, 2000. P. 201−290.
- Aurenhammer F. Voronoi diagrams a survey of a fundamental geometric data structure // ACM Computing Surveys. — 1991. — Vol. 23. — No. 3. — P. 345−405.
- Blelloch G., Miller G.L., Talmor D. Developing a practical projection-based parallel Delaunay algorithm. // In Proc. 12th Annual ACM Symposium on Computational Geometry. 1996. — P. 186−195.
- Boissonnat J.-D., Teillaud M. On the randomized construction of the Delaunay tree. // Theoretical Computer Science. 1993. — Vol. 112. — P. 339−354.
- Bonapace C.R., Lo C.-Y. An 0(n log m) algorithm for VLSI design rule checking. // IEEE Transactions on Computer-Aided Design. 1992. — Vol. 11.- No. 6.-P. 753−758.
- Brumberger H., Goodisman J. Voronoi cells: an interesting and potentially useful cell model for interpreting the small angle scattering of catalysts. // Journal of Applied Crystallography. 1983. — Vol. 16. — P. 83−88.
- Carabelas M.I., Yvinec M. Dynamic additively weighted Voronoi diagrams in 2D. // Lecture Notes in Computer Science. 2002. — Vol. 2461. — P. 586−598.
- Carpenter C.W., Horowitz M. Generating incremental VLSI compactionthspacing constraints. // In Proc. of 24 ACM/IEEE Design Automation Conference. -1987.-P. 291−297.
- Cho Y.E. A subjective review of compaction // In Proc. of 22nd IEEE Design Automation Conference. 1985. — P. 396−404.
- Choi S.-G., Kyung C.-M. A floorplanning algorithm using rectangular Voronoi diagram and force-directed block shaping. // In Proc. of IEEE International Conference on Computer-Aided Design, 1991. Santa Clara, CA, USA, 1991. P. 5659.
- Clarkson K.L., Mehlhorn K., Seidel R. Four results on randomized incremental constructions. // Computational Geometry: Theory and Applications. 1993. — Vol. 3.-P. 185−212.
- Clarkson K.L., Shor P.W. Applications of random sampling in computational geometry, II. // Discrete Computational Geometry. 1989. — Vol. 4. — P. 387−421.
- Cong J., Fang J., Khoo K.-Y. DUNE a multi-layer gridless routing system with wire planning. // In Proc. of ISPD'2000. — 2000. — San Diego, CA. — P. 12−18.
- Cong J., Sarrafzadeh M. Incremental physical design. // Proc. of the 2000 International Symposium on Physical Design. 2000. — San Diego, CA. — P. 84−92.
- Dehne F., Klein R. «The big sweep»: on the power of the wavefront approach to Voronoi diagrams. // Algorithmica. 1997. — Vol. 17. — P. 19−32.
- Descartes R. Principia Philosophiae. Ludovicus Elzevirius. Amsterdam, 1644.
- Devillers O., Meiser S. Teillaud M. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. // Computational Geometry: Theory and Applications. -1992. Vol. 2. — P. 55−80.
- Diaz-Banes J.M., Gomez F., Ventura I. The anchored Voronoi diagram: static, dynamic versions and applications. // International Journal on Computational Geometry and Applications. 2006. — Vol. 16. — No. 4. — P. 315−332.
- Dirichlet G.L. Uber die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. // Journal fur die reine und angewandte Mathematik. -1850.-T. 40.- S. 209−227.
- Dwyer R.A. A faster divide-and-conquer algorithm for constructing Delaunay triangulations. // Algorithmica. 1987. — Vol. 2. — P. 137−151.
- Fang J., Wong J.S.L., Zhang K., Tang P. A fast constraint graph based compactor for VLSI circuit layouts // In Proc. of International Conference on Circuits and Systems. 1991. — P. 628−631.
- Feng Z. et al. An 0(n log n) algorithm for obstacle-avoiding routing tree construction in the X-geometry plane. // In Proc. of ISPD'06. San Jose, Π‘ A, USA, 2006.-P. 48−55.
- Fortune S. Voronoi diagrams and Delaunay triangulations. // In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, vol. 1 of Lecture Notes Series on Computing, pp. 193−233. World Scientific, Singapore, 1st edition, 1992.
- Fortune S J. A sweepline algorithm for Voronoi diagrams. // Algorithmica. -1987.-Vol. 2.-P. 153−174.
- Gavrilova M.L., Rokne J. Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean (/-dimensional space. // Computer Aided Geometric Design. 2003. — Vol. 20, P. 231−242.
- Gold C.M., Remmele P.R., Roos T. Fully dynamic and kinematic Voronoi diagrams in GIS. // Algorithmica. Special Issue on Cartography and GIS. — 1999. -20 p.
- Gowda I.G., Kirkpatrick D.G., Lee D.T. A. Naamad. Dynamic Voronoi diagrams. // In IEEE Transactions on Information Theory. 1983. — Vol. 29. — No. 5. -P. 724−731.
- Green P.J., Sibson R.R. Computing Dirichlet tessellations in the plane. // The Computer Journal. 1978.-Vol. 21.-P. 168−173.
- Guibas L.J. Mitchell J.S.B., Roos T. Voronoi diagrams of moving points in thethplane. // In Proc. of 17 International Workshop Graph-Theoretic Concepts in Computer Science, Vol. 570 of Lecture Notes in Computer Science, 1992. P. 113— 125.
- Guibas L.J., Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. // ACM Transactions on Graphics. -1985. Vol. 4. — No. 2. — P. 74−123.
- Held M. Voronoi Diagrams and Offset Curves of Curvilinear Polygons. // Computer-Aided design. 1998. — Vol. 30. — No. 4. — P. 287−300.
- Heng F.-L., Chen Zh., Tellez G.E. A VLSI artwork legalization technique based on a new criterion of minimum layout perturbation // In Proc. of ISPD'97. -1997.-P. 116−121.
- Huttenlocher D.P., Kedem K., Kleinberg J.M. On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane. // In Proc. of 8th Annual ACM Symposium on Computational Geometry.1992.-Vol. 6.-P. 110−119.
- Jungkrajarng N. et al. IPRAIL — intellectual property reuse-based analog 1Π‘ layout automation. // Integration, the VLSI journal. 2003. — Vol. 36. — P. 237−262.
- Kahng A.B., Robins G. On optimal interconnections for VLSI. Kluwer Academic Publishers, 1994. 304 p.
- Katajainen J., Koppinen M. Constructing Delaunay triangulations by merging buckets in quadtree order. // Annales Societatis Mathematicae Polonae, Series IV, Fundamenta Informaticae. 1988. — Vol. 11. — No. 3. — P. 275−288.
- Kim C.-M. et al. Interaction interfaces in proteins via the Voronoi diagram of atoms. // Computer-Aided Design. 2006. — Vol. 38. — P. 1192−1204.
- Kirkpatrick D. Efficient Computation of Continuous Skeletons. // Proceedings of the 20th Annual Symposium on Foundations of Computer Science. 1979. — P. 18−27.-194 p.
- Klein R. Abstract Voronoi diagrams and their applications (extended abstract). In H. Noltemeier, ed. // Proc. of the Workshop on Computational Geometry and its Applications, Wiirzburg, Lecture Notes in Computer Science 333, 1988. P. 148 157.
- Klein R. Concrete and abstract Voronoi diagrams. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1989. — Vol. 400. — 167 p.
- Klein R., Mehlhorn K., Meiser S. Randomized incremental construction of abstract Voronoi diagrams. // Computational Geometry: Theory and Applications.1993.-Vol. Π.-No. 3.-pp. 157−184.
- Klein R., Mehlhorn K., Meiser S. Randomized incremental construction of abstract Voronoi diagrams. // Computational Geometry: Theory and Applications. -1993.-Vol.3.-P. 157−184.
- Kuh E.S., Ohtsuki T. Recent advances in VLSI layout. // Proc. of the IEEE. -1990. Vol. 78, № 2. — P. 237−263.
- Lee D.T., Wong C.K. Voronoi diagrams in the L ((L") metrics with 2-dimensional storage applications. // SIAM Journal on Computing. 1980. — Vol. 9. -P. 200−211.
- Lee D.T., Drysdale R.L. Generalization of Voronoi diagrams in the plane. // SIAM Journal on Computing. 1981. — Vol. 10. — P. 73−87.
- Lee J.-F. A new framework of design rules for compaction of VLSI layouts. // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. -1988.-Vo. 7. No. 11.-P. 1195−1204.
- Li J.-Y., Li Y.-L. An efficient tile-based ECO router with routing graph reduction and enhanced global routing flow. // In Proc. of ISPD'05. 2005. — P. 713.
- Mayya N. and Rajan V.T. An Efficient Shape-Representation Scheme Using Voronoi Skeletons. // Pattern Recognition Letters. 1995. — Vol. 16. — No. 2. — P. 147−160.
- Mercier F. and Baujard O. Voronoi diagrams to model forest dynamics in French Guiana. // In Proceedings of GeoComputation'97 & Sirc'97. University of Otago, New Zeeland. — 1997. — P. 161−171.
- Mulmuley K. Randomized algorithms in computational geometry. // In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, 2000, Elsevier Science Publishers B.V. North-Holland, Amsterdam. pp. 703−724.
- O’Dunulaing Π‘. and Yap C.K. A Retraction Method for Planning the Motion of a Disc. // Journal of Algorithms. 1985. — Vol. 6. — P. 104−111.
- Ohya Π’., Iri M., Murota K. A fast Voronoi diagram algorithm with quaternary tree bucketing. // Information Processing Letters. -1984. Vol. 18. — P. 227−231.
- Okabe A., Boots Π., Sugihara K. Spatial tessellations: concepts and applications of Voronoi diagrams. 2nd edition. — Wiley, Chichester, 2000. — 671 p.
- Papadopoulou E. Critical Area Computation for Missing Material Defects in VLSI Circuits. // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2001. — Vol. 20. — No. 5. — P. 583−597.
- Papadopoulou E., Lee D.T. The L (X) Voronoi diagram of segments and VLSI applications. // International Journal of Computational Geometry and Applications. -2001.-Vol. 11. -P. 503−528.
- Seidel R. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. // In 1978−1988 10-Years IIG. Inst. Inform. Process., Techn. Univ. Graz, Austria.-1988.-P. 178−191.
- Shamos M.I., Hoey D. Closest-Point Problems. // In Proc. of 16th Annual IEEE Symposium on FOCS. 1975. — P. 151−162.
- Sherwani N. Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Dordrecht, 1999. — 482 p.
- Sloan S.W. A fast algorithm for constructing Delaunay triangulations in the plane. // Advances in Engineering Software. 1987. — Vol. 9. — No. 1, P. 34−55.
- Suzuki G. A practical online design rule checking system. // In Proc. of 27th ACM/IEEE Design Automation Conference. 1990. — P. 246−252.
- Voronoi G.M. Nouvelles applications des parametres continus a la theorie des formes quadratiques. // deuxieme Memoire: Recherches sur les parallelloedres primitifs. Journal fur die reine und angewandte Mathematik. 1908. — V. 134. — S. 198−287.
- Π£ΡΠ²Π΅ΡΠΆΠ΄Π°Ρ" ΠΠΈΡΠ΅ΠΊΡΠΎΡ ΠΎΡΠ΄Π΅Π»Π΅Π½ΠΈΡ Π°ΡΡ ΠΈΡΠ΅ΠΊΡΡΡΡ ΠΠ½ΡΠ΅Π»1. Π§Π»Π΅Π½-ΠΊΠΎΡΡΠ΅ΡΠΏΠΎΠ½Π΄Π΅Π½Ρ Π ΠΠ1. ΠΠΊΡ Π²Π½Π΅Π΄ΡΠ΅Π½ΠΈΡΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΎΠ² Π΄ΠΈΡΡΠ΅ΡΡΠ°ΡΠΈΠΎΠ½Π½ΠΎΠΉ ΡΠ°Π±ΠΎΡΡ ΠΠ°Π»ΠΈΠ½Π°ΡΡΠΊΠ°ΡΠ° ΠΠΎΡΡΠ°ΡΠ°* ΠΠ±Ρ^ΡΠΈΠ
- Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΈ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌ ΡΠΎΠΏΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π‘ΠΠΠ‘ Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π΄ΠΈΠ°Π³ΡΠ°ΠΌΠΌ ΠΠΎΡΠΎΠ½ΠΎΠ³ΠΎ", ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½ΠΎΠΉ Π½Π° ΡΠΎΠΈΡΠΊΠ°Π½ΠΈΠ΅ ΡΡΡΠ½ΠΎΠΉ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ ΠΊΠ°Π½Π΄ΠΈΠ΄Π°ΡΠ° Π½Π°ΡΠΊ.
- J1/Ρ ΠΈ'^Π»-Ρ- Π΄.Ρ.Π½. Π.Π. ΠΡΠ»ΠΈΡ ΠΌΠ°Π½' .-.Β¦β’/→-β’β’Β¦/ Β¦ ΠΊ.Ρ.Π½. Π.Π. ΠΠΌΡΡΠΈΠ½/ Β¦