{"?xml":{"@version":"1.0"},"edm: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-CUMIJ8AA/bd5ccfba-e12f-4d3f-b4d3-6b3f614ed169/PDF","dcterms:extent":"237 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-CUMIJ8AA/43f0eb18-6acc-409a-b196-2c313463cf9c/TEXT","dcterms:extent":"17 KB"}],"edm:TimeSpan":{"@rdf:about":"1977-2026","edm:begin":{"@xml:lang":"en","#text":"1977"},"edm:end":{"@xml:lang":"en","#text":"2026"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-CUMIJ8AA","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-EE5UIE2V"},{"@xml:lang":"sl","#text":"Informatica (Ljubljana)"}],"dcterms:issued":"2004","dc:creator":["Boben, Marko","Jaklič, Gašper","Orbanić, Alen","Pisanski, Tomaž"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:28"},{"@xml:lang":"sl","#text":"številka:3"},{"@xml:lang":"sl","#text":"str. 239-243"}],"dc:identifier":["ISSN:0350-5596","COBISSID:13285977","URN:URN:NBN:SI:doc-CUMIJ8AA"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Slovensko društvo Informatika"},"dc:subject":[{"@xml:lang":"sl","#text":"prikaz podatkov"},{"@xml:lang":"sl","#text":"teorija grafov"},{"@xml:lang":"sl","#text":"vizualizacija"},{"@rdf:resource":"http://www.wikidata.org/entity/Q131476"}],"dcterms:temporal":{"@rdf:resource":"1977-2026"},"dc:title":{"@xml:lang":"sl","#text":"Algorithms for drawing polyhedra from 3-connected planar graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"Two algorithms for producing polyhedral representations for 3-connected planar graphs are discussed in the paper. One of them uses Tutte's drawing algorithm to produce 2D drawing. Then the drawing is lifted into 3D space obtaining a polyhedral embedding. The other is simple algorithm by G. Hart for drawing canonical polyhedral representations. Some alternative aspects (physical model, Markov chain model) in algorithms for obtaining Tutte's drawings are presented and proved"},{"@xml:lang":"sl","#text":"V članku sta predstavljena dva algoritma za izračun poliedrskih upodobitev danega 3-povezanega ravninskega grafa. Prvi upodablja Tuttejevo 2D risbo, ki jo dvignemo v 3D prostor in dobimo poliedrsko upodobitev. Drugi je preprost algoritem, ki ga je predlagal G. Hart. Namenjen je risanju kanoničnih poliedrskih upodobitev. Prikazani so tudi nekateri alternativni algoritmi za izračun Tuttejeve risbe (fizikalni model, verjetnostni model z markovskimi verigami). Dokazano je njihovo delovanje"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:DOC-CUMIJ8AA","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-CUMIJ8AA"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-CUMIJ8AA/bd5ccfba-e12f-4d3f-b4d3-6b3f614ed169/PDF"},"edm:rights":{"@rdf:resource":"http://rightsstatements.org/vocab/InC/1.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Slovensko društvo Informatika"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:DOC-CUMIJ8AA/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-CUMIJ8AA"}}}}