<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-1048</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>PHYSICAL AND MATHEMATICAL SCIENCES</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ФИЗИКО-МАТЕМАТИЧЕСКИЕ НАУКИ</subject></subj-group></article-categories><title-group><article-title>FORMATION OF FULL COLLECTION OF SCELETONS FOR FREE CONCOURS</article-title><trans-title-group xml:lang="ru"><trans-title>Формирование полного набора скелетонов произвольного контура</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>КОРОБЕЙНИКОВ</surname><given-names>АЛЕКСАНДР ПЕТРОВИЧ</given-names></name><name name-style="western" xml:lang="en"><surname>KOROBEINIKOV</surname><given-names>Alexander P.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>САДОВОЙ</surname><given-names>НИКОЛАЙ НИКОЛАЕВИЧ</given-names></name><name name-style="western" xml:lang="en"><surname>SADOVOY</surname><given-names>Nikolay N.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Донской государственный технический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Don State Technical University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2010</year></pub-date><pub-date pub-type="epub"><day>30</day><month>12</month><year>2010</year></pub-date><volume>10</volume><issue>6</issue><fpage>834</fpage><lpage>837</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; KOROBEINIKOV A., SADOVOY N., 2010</copyright-statement><copyright-year>2010</copyright-year><copyright-holder xml:lang="ru">КОРОБЕЙНИКОВ А., САДОВОЙ Н.</copyright-holder><copyright-holder xml:lang="en">KOROBEINIKOV A., SADOVOY N.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.vestnik-donstu.ru/jour/article/view/1048">https://www.vestnik-donstu.ru/jour/article/view/1048</self-uri><abstract><p>Presentation algorithm of the closed contour in sceletons collection is presented. Sceletons collection represents sequence of segments which connect circle centers.  Circles fit into the generated contour segment. The major direction of algorithm usage is text information processing without setting up the certain type face.</p></abstract><trans-abstract xml:lang="ru"><p>В статье приводится алгоритм представления замкнутого контура набором скелетонов. Набор скелетонов представляет собой последовательность отрезков, которые соединяют центры окружностей. Окружности вписываются в сформированный фрагмент  контура. Основное направление использования алгоритма – обработка текстовой информации без настройки на конкретный вид шрифта.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>распознавание образов</kwd><kwd>анализ текстов</kwd><kwd>контурная линия</kwd><kwd>скелетон</kwd><kwd>алгоритм.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>pattern recognition</kwd><kwd>text analysis</kwd><kwd>contour line</kwd><kwd>sceleton</kwd><kwd>algorithm.</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Терентьев И.В. Построение скелетонов методом интерполяции сплайнами / И.В. Терентьев, Г.Л. Гончаров, А.В. Граковский. // Латвия. Transport and Telecommunication. – 2002. – Т.3. – №4. – С.33-38.</mixed-citation><mixed-citation xml:lang="en">Terent'ev I.V., Goncharov G.L., Grakovskii A.V. Postroenie skeletonov metodom interpolyacii splainami. Latviya. Transport and Telecommunication. vol. 3, 2002, №4, s.33-38.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кучуганов А.В. Распознавание рукописных текстов / А.В. Кучуганов // Современные информационные технологии и письменное наследие: от древних рукописей к электронным текстам: материалы междунар. науч. конф. Ижевск, 13-17 июля 2006 г. – Ижевск: Изд-во ИжГТУ, 2006. – С.98-113.</mixed-citation><mixed-citation xml:lang="en">Kuchuganov A.V. Raspoznavanie rukopisnyh tekstov/ Sovremennye informacionnye tehnologii i pis'mennoe nasledie: ot drevnih rukopisei k elektronnym tekstam: materialy mejdunar. nauchn. konf. Ijevsk, 13-17 iyulya 2006 g. – Ijevsk: Izd-vo IjGTU, 2006, – s. 98-113.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
