<?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-V80W257X/023a6f89-46bb-4a57-b48c-e9f526a78a08/PDF"><dcterms:extent>1599 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-V80W257X/a82b52c6-d038-443d-9a8d-834c7939e3be/TEXT"><dcterms:extent>17 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2026"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-V80W257X"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-FNN1A9OB" /><dcterms:issued>2012</dcterms:issued><dc:creator>Jaklič, Gašper</dc:creator><dc:creator>Kanduč, Tadej</dc:creator><dc:creator>Praprotnik, Selena</dc:creator><dc:creator>Žagar, Emil</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:59</dc:format><dc:format xml:lang="sl">str. 1-10</dc:format><dc:identifier>ISSN:0473-7466</dc:identifier><dc:identifier>COBISSID:16255577</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-V80W257X</dc:identifier><dc:language>sl</dc:language><dc:publisher xml:lang="sl">Društvo matematikov, fizikov in astronomov Slovenije</dc:publisher><dcterms:isPartOf xml:lang="sl">Obzornik za matematiko in fiziko</dcterms:isPartOf><dc:subject xml:lang="en">Dijkstra's algorithm</dc:subject><dc:subject xml:lang="sl">Dijkstrov algoritem</dc:subject><dc:subject xml:lang="sl">energijski funkcional</dc:subject><dc:subject xml:lang="en">energy functional</dc:subject><dc:subject xml:lang="sl">interpolacijski problem</dc:subject><dc:subject xml:lang="en">interpolation problem</dc:subject><dc:subject xml:lang="en">macroelements</dc:subject><dc:subject xml:lang="sl">makroelementi</dc:subject><dc:subject xml:lang="sl">matematika</dc:subject><dc:subject xml:lang="en">mathematics</dc:subject><dc:subject xml:lang="en">numerical analysis</dc:subject><dc:subject xml:lang="sl">numerična analiza</dc:subject><dc:subject xml:lang="sl">polinomske krivulje</dc:subject><dc:subject xml:lang="en">polynomial curves</dc:subject><dcterms:temporal rdf:resource="2008-2026" /><dc:title xml:lang="sl">Z najmanj truda na Šmarno goro!|</dc:title><dc:description xml:lang="sl">Finding a curve on the surface with constraints is a difficult problem frequently encountered in civil engineering at road and railway construction. In this article, an optimal mountain ascent (in the sense of energy consumption) is considered. Discrete terrain data are given. A smooth terrain description is constructed using macroelements. An energy functional which depends on terrain inclination and on path length, is defined. By computing energy on the boundaries of polynomial patches, the problem transforms into a discrete problem of finding the cheapest path on a mesh of polynomial curves. Numerical results indicate that the resulting paths are good approximations of the natural rutes. Some examples on real data are presented</dc:description><dc:description xml:lang="sl">Iskanje krivulj na ploskvi z danimi omejitvami je v splošnem težak problem. Nanj naletimo npr. v gradbeništvu pri gradnji cest in železnic na razgibanem terenu. V članku se omejimo na problem iskanja vzpona na goro, pri katerem porabimo najmanj energije. Dane so diskretne meritve terena, na podlagi katerih s pomočjo makroelementov konstruiramo gladek opis reliefa. Energijski funkcional definiramo v odvisnosti od naklona in dolžine poti. Z izračunom energije na robovih polinomskih ploskev zastavljeni problem prevedemo na diskretni problem iskanja najcenejše poti na mreži polinomskih krivulj. Numerični rezultati kažejo, da se dobljene poti dobro ujemajo z naravnimi, kar predstavimo na primeru realnih podatkov</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-V80W257X"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-V80W257X" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-V80W257X/023a6f89-46bb-4a57-b48c-e9f526a78a08/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">Društvo matematikov, fizikov in astronomov</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-V80W257X/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-V80W257X" /></ore:Aggregation></rdf:RDF>