<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-M8P33DF1/35ce944b6d159ae--d493d3add7-93dffa9-/PDF"><dcterms:extent>1034 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-M8P33DF1/a3c13dd6-dabd-4e99-94f9-fda9574d5e33/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-M8P33DF1/48d43b76-0099-4438-b801-6c3a7e1c7bf2/WEB"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-M8P33DF1"><dcterms:issued>2018</dcterms:issued><dc:creator>Kovač, Boštjan</dc:creator><dc:contributor>Žagar, Emil</dc:contributor><dc:format xml:lang="sl">72 str., 30 cm</dc:format><dc:identifier>COBISSID:18316889</dc:identifier><dc:identifier>PID:https://repozitorij.uni-lj.si/IzpisGradiva.php?id=100279</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-M8P33DF1</dc:identifier><dc:language>sl</dc:language><dc:publisher xml:lang="sl">B. Kovač</dc:publisher><dc:source xml:lang="sl">visokošolska dela</dc:source><dc:subject xml:lang="sl">asimptotična analiza</dc:subject><dc:subject xml:lang="en">asymptotic analysis</dc:subject><dc:subject xml:lang="en">best uniform approximation</dc:subject><dc:subject xml:lang="en">Bézier curve</dc:subject><dc:subject xml:lang="sl">Bézierjeva krivulja</dc:subject><dc:subject xml:lang="en">circular arc</dc:subject><dc:subject xml:lang="en">conic sections</dc:subject><dc:subject xml:lang="en">curvature error function</dc:subject><dc:subject xml:lang="sl">homotopija</dc:subject><dc:subject xml:lang="en">homotopy</dc:subject><dc:subject xml:lang="sl">krožni lok</dc:subject><dc:subject xml:lang="sl">matematika</dc:subject><dc:subject xml:lang="en">mathematics</dc:subject><dc:subject xml:lang="sl">najboljša enakomerna aproksimacija</dc:subject><dc:subject xml:lang="sl">napaka ukrivljenosti</dc:subject><dc:subject xml:lang="en">radial error function</dc:subject><dc:subject xml:lang="sl">radialna napaka</dc:subject><dc:subject xml:lang="sl">stožnice</dc:subject><dc:title xml:lang="sl">Geometrijska aproksimacija krožnih lokov| doktorska disertacija|</dc:title><dc:description xml:lang="sl">In this PhD thesis several new methods for an approximation of the circular arc are presented. The first part represents asymptotically the best single-sided geometric approximation of order one (?$G^1$?) according to the radial error. It is an approximation with the quartic Bézier curve. The control points are set so that in addition to the boundary points the approximative curve touches the circular arc with order one at two inner points. Due to the complexity of the system of equations, the proof of the existence of a solution is made using the homotopy. The generalization of the derived method is then used for the approximation of conic sections. The method is used in a subdivision process to determine new vertices until some additional conditions are met. Each individual part is then approximated using the derived method. In the second part of the thesis curvature error is used instead of the radial one. Some simple low-degree polynomial methods and biarc methods are presented. It is confirmed that the derived methods still have the optimal approximation order according to the radial error, while the approximation order according to the curvature error is reduced by two as expected due to the second order derivatives. As it turns out the optimal approximation of the circular arc is always achieved when the error equally oscillates. The last part of the thesis is thus dedicated to the methods of this type. These are low-degree approximations that have a geometric contact of some order with the circular arc at the boundary points, or they only approximate the same angle as the circular arc. In the latter case, we obtain a scaled Chebyshev polynomial. Similarly as in the first part, when a complicated system of equations appears, the proof of the existence of a solution is done using the homotopy</dc:description><dc:description xml:lang="sl">V doktorski disertaciji je izpeljanih nekaj novih metod za aproksimacijo krožnega loka. Prvi del predstavlja asimptotično najboljša enostranska geometrijska aproksimacija reda ena (?$G^1$?) glede na radialno napako. Metoda predstavlja aproksimacijo z Bézierjevimi krivuljami stopnje štiri, pri kateri kontrolne točke določimo tako, da se poleg robnih točk, aproksimacijska krivulja dotika krožnega loka z redom ena še v dveh notranjih točkah. Dokaz obstoja rešitve je zaradi kompleksnosti sistema enačb narejen s pomočjo homotopije. V nadaljevanju je izpeljana metoda uporabljena za aproksimacijo stožnic. Aproksimacijo izvedemo tako, da do izpolnitve dodatnih pogojev metodo uporabimo v subdivizijskem postopku za določitev novih delilnih točk, nato z isto metodo aproksimiramo vsak posamezen del. V drugem delu disertacije za mero napake namesto radialne napake vzamemo napako ukrivljenosti. Predstavljenih je nekaj preprostih metod s polinomi nizkih stopenj in nekaj metod, kjer za aproksimacijo uporabimo dvoloke. Ugotovili smo, da imajo izpeljane metode še vedno optimalni red aproksimacije glede na radialno napako in za dva reda nižji aproksimacijski red glede na napako ukrivljenosti, ki je posledica odvodov drugega reda v formuli za ukrivljenost. Izkazalo se je, da je optimalna aproksimacija krožnega loka vedno dosežena tedaj, ko napaka enakomerno oscilira, zato smo zadnji del disertacije posvetili izpeljavi metod takšne oblike. Gre za aproksimacije s polinomi nizkih stopenj, ki imajo v robnih točkah s krožnim lokom geometrijski kontakt določenega reda, ali pa samo aproksimirajo podan krožni lok. V slednjem primeru dobimo za rešitev skaliran polinom Čebiševa. Podobno kot v prvem delu disertacije, se tudi tu v primeru kompleksnejših sistemov enačb poslužimo dokaza obstoja rešitve s pomočjo homotopije</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">visokošolska dela</dc:type><dc:type xml:lang="en">theses and dissertations</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q1266946" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:DOC-M8P33DF1"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-M8P33DF1" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-M8P33DF1/35ce944b6d159ae--d493d3add7-93dffa9-/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza v Ljubljani, Fakulteta za matematiko in fiziko</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:DOC-M8P33DF1/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-M8P33DF1" /></ore:Aggregation></rdf:RDF>