maisМоделирование и анализ информационных системModeling and Analysis of Information Systems1818-10152313-5417Yaroslavl State University10.18255/1818-1015-2012-4-168-173mais-50Research ArticleОригинальные статьиArticlesПервая ярославская летняя школа по дискретной и вычислительной геометрииThe First Yaroslavl Summer School on Discrete and Computational GeometryДолбилинНиколайDolbilinNikolay

Steklov Mathematical Institute, the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

Steklov Mathematical Institute, the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

dolbilin@mi.ras.ruЭдельсбруннерГ.EdelsbrunnerHerbert

Klosterneuburg, Austria;

the head of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

Klosterneuburg, Austria;

the head of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

edels@ist.ac.atИвановАлександрIvanovAlexandr

the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

aoiva@mech.math.msu.suМусинОлегMusinOleg

the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

the member of International Delaunay Laboratory “Discrete and Computational Geometry” in P.G. Demidov Yaroslavl State University

omusin@gmail.comP.G. Demidov Yaroslavl State UniversityРоссияP.G. Demidov Yaroslavl State UniversityRussian FederationIST Austria (Institute of Science and Technology Austria); P.G. Demidov Yaroslavl State UniversityАвстрияIST Austria (Institute of Science and Technology Austria); P.G. Demidov Yaroslavl State UniversityAustriaMoscow State University, P.G. Demidov Yaroslavl State UniversityРоссияMoscow State University; P.G. Demidov Yaroslavl State UniversityRussian FederationUniversity of Texas in Brownsville; P.G. Demidov Yaroslavl State UniversityСоединённые Штаты АмерикиUniversity of Texas in Brownsville; P.G. Demidov Yaroslavl State UniversityUnited States201228022015194168173Copyright © Долбилин Н., Эдельсбруннер Г., Иванов А., Мусин О., 20152015Долбилин Н., Эдельсбруннер Г., Иванов А., Мусин О.Dolbilin N., Edelsbrunner H., Ivanov A., Musin O.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://www.mais-journal.ru/jour/article/view/50

Обобщены результаты работы первой ярославской летней школы по дискретной и вычислительной геометрии и обозначены перспективы будущей работы.

We summarize the results of the First Yaroslavl Summer School on Discrete and Computational Geometry and asses its future perspectives.

дискретная и вычислительная геометриялетняя школаDiscrete and Computational GeometrySummer schoolReferencesEdelsbrunner H. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, Cambridge, England, 2001.Edelsbrunner H. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, Cambridge, England, 2001.Matveev S. V. Lectures on Algebraic Topology. European Math. Soc., Zuerich, Switzerland, 2006.Matveev S. V. Lectures on Algebraic Topology. European Math. Soc., Zuerich, Switzerland, 2006.Edelsbrunner H., Harer J. Computational Topology: An Introduction. Amer. Math. Soc., Providence, Rhode Island, 2010.Edelsbrunner H., Harer J. Computational Topology: An Introduction. Amer. Math. Soc., Providence, Rhode Island, 2010.Dolbilin N. P. Properties of Faces of Parallelohedra // Proc. Steklov Inst. Math. 2009. 266. P. 105–119.Dolbilin N. P. Properties of Faces of Parallelohedra // Proc. Steklov Inst. Math. 2009. 266. P. 105–119.Delone B. N. Geometry of positive quadratic forms // Uspekhi Matem. Nauk. 1937. No 3. P. 16–62 [in Russian].Delone B. N. Geometry of positive quadratic forms // Uspekhi Matem. Nauk. 1937. No 3. P. 16–62 [in Russian].Alexandrov A. D. Convex Polyhedra. Berlin, Heidelberg, New York, Springer, 2005 [Translation from: Moscow, GTTL, 1950].Alexandrov A. D. Convex Polyhedra. Berlin, Heidelberg, New York, Springer, 2005 [Translation from: Moscow, GTTL, 1950].Matveev S. V. Algorithmic Topology and Classification of 3-manifolds. Springer ACM-monographs, 2003; Moscow, MTsMNO, 2007.Matveev S. V. Algorithmic Topology and Classification of 3-manifolds. Springer ACM-monographs, 2003; Moscow, MTsMNO, 2007.Matveev S. V. Roots and decompositions of topological 3D objects // Uspekhi matem. Nauk. 2012. 67: 3(405). P. 63—114 [in Russian, English Translation: Russian Math. Surveys, to appear].Matveev S. V. Roots and decompositions of topological 3D objects // Uspekhi matem. Nauk. 2012. 67: 3(405). P. 63—114 [in Russian, English Translation: Russian Math. Surveys, to appear].Ivanov A. O. and Tuzhilin A. A. Branching Solutions to One-Dimensional Variational Problems World Scientific, Singapore, 2000.Ivanov A. O. and Tuzhilin A. A. Branching Solutions to One-Dimensional Variational Problems World Scientific, Singapore, 2000.Ivanov A. O., Tuzhilin A. A. Extreme Networks Theory. Moscow–Izhevsk, Inst. Komp. Issl., 2003 [in Russian].Ivanov A. O., Tuzhilin A. A. Extreme Networks Theory. Moscow–Izhevsk, Inst. Komp. Issl., 2003 [in Russian].Ivanov A. O., Tuzhilin A. A. One-dimensional Gromov minimal filling, arXiv:1101.0106v2 [math.MG] (http://arxiv.org), Matem. Sbornik. 2012. 203. P. 65–118.Ivanov A. O., Tuzhilin A. A. One-dimensional Gromov minimal filling, arXiv:1101.0106v2 [math.MG] (http://arxiv.org), Matem. Sbornik. 2012. 203. P. 65–118.Pak I. Lectures on Discrete and Polyhedral Geometry: Manuscript (http://www.math.ucla.edu/~pak/book.htm).Pak I. Lectures on Discrete and Polyhedral Geometry: Manuscript (http://www.math.ucla.edu/~pak/book.htm).Kaplan H., Matouˇsek J., Sharir M. Simple proofs of classical theorems in discrete geometry via the Guth–Katz polynomial partitioning technique // Discrete Comput. Geom. 2012. 48. P. 499–517.Kaplan H., Matouˇsek J., Sharir M. Simple proofs of classical theorems in discrete geometry via the Guth–Katz polynomial partitioning technique // Discrete Comput. Geom. 2012. 48. P. 499–517.Kettner L., Mehlhorn K., Pion S., Schirra S., Yap C. Classroom examples of robustness problems in geometric computations // Computational Geometry: Theory and Applications. 2008. 40. P. 61–78.Kettner L., Mehlhorn K., Pion S., Schirra S., Yap C. Classroom examples of robustness problems in geometric computations // Computational Geometry: Theory and Applications. 2008. 40. P. 61–78.Mehlhorn K., Yap C. Robust Geometric Computation: Manuscript (http://cs.nyu.edu/yap/book/egc/).Mehlhorn K., Yap C. Robust Geometric Computation: Manuscript (http://cs.nyu.edu/yap/book/egc/).Liotta G., Preparata F. P., Tamassia R. Robust proximity queries: An illustration of degree-driven algorithmic design // SIAM Journal on Computing. 1999. 28. P. 864–889.Liotta G., Preparata F. P., Tamassia R. Robust proximity queries: An illustration of degree-driven algorithmic design // SIAM Journal on Computing. 1999. 28. P. 864–889.Burnikel C., Funke S., Seel M. Exact geometric computation using cascading // International Journal of Computational Geometry and Applications. 2001. 11. P. 245–266.Burnikel C., Funke S., Seel M. Exact geometric computation using cascading // International Journal of Computational Geometry and Applications. 2001. 11. P. 245–266.Funke S., Klein C., Mehlhorn K., Schmitt S. Controlled perturbation for Delaunay triangulations // Symposium on Discrete Algorithms. 2005. P. 1047–1056.Funke S., Klein C., Mehlhorn K., Schmitt S. Controlled perturbation for Delaunay triangulations // Symposium on Discrete Algorithms. 2005. P. 1047–1056.Halperin D., Leiserowitz E. Controlled perturbation for arrangements of circles // Symposium on Computational Geometry. 2003. P. 264–273.Halperin D., Leiserowitz E. Controlled perturbation for arrangements of circles // Symposium on Computational Geometry. 2003. P. 264–273.Mehlhorn K., Osbild R., Sagraloff M. A general approach to the analysis of controlled perturbation algorithms // Computational Geometry: Theory and Applications. 2011. 44. P. 507–528.Mehlhorn K., Osbild R., Sagraloff M. A general approach to the analysis of controlled perturbation algorithms // Computational Geometry: Theory and Applications. 2011. 44. P. 507–528.Br¨onimann H., Burnikel C., Pion S. Interval arithmetic yields efficient dynamic filters for computational geometry // Discrete Applied Mathematics. 2001. 109. P. 25–47.Br¨onimann H., Burnikel C., Pion S. Interval arithmetic yields efficient dynamic filters for computational geometry // Discrete Applied Mathematics. 2001. 109. P. 25–47.Devillers O., Pion S. Efficient exact geometric predicates for Delaunay triangulations // 5th Workshop on Algorithm Engineering and Experiments (ALENEX), 2003.Devillers O., Pion S. Efficient exact geometric predicates for Delaunay triangulations // 5th Workshop on Algorithm Engineering and Experiments (ALENEX), 2003.Kerber M. Geometric Algorithms for Algebraic Curves and Surfaces, PhD Thesis, Saarland University, 2009 (http://www.mpi-inf.mpg.de/~mkerber/kerber_diss.pdf).Kerber M. Geometric Algorithms for Algebraic Curves and Surfaces, PhD Thesis, Saarland University, 2009 (http://www.mpi-inf.mpg.de/~mkerber/kerber_diss.pdf).

The authors declare that there are no conflicts of interest present.