{"?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-IFL9NU9W/532202af-685c-441d-9ff9-23da517a12b9/PDF","dcterms:extent":"1300 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-IFL9NU9W/36cf8ffc-94c5-4c14-8d5b-8c98829a57f6/TEXT","dcterms:extent":"18 KB"}],"edm:TimeSpan":{"@rdf:about":"1993-2026","edm:begin":{"@xml:lang":"en","#text":"1993"},"edm:end":{"@xml:lang":"en","#text":"2026"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-IFL9NU9W","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-PGKNDR0J"},{"@xml:lang":"sl","#text":"Uporabna informatika (Ljubljana)"}],"dcterms:issued":"2004","dc:creator":"Gomboši, Matej","dc:format":[{"@xml:lang":"sl","#text":"letnik:12"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 90-96"}],"dc:identifier":["ISSN:1318-1882","COBISSID:8898838","URN:URN:NBN:SI:doc-IFL9NU9W"],"dc:language":"sl","dc:publisher":{"@xml:lang":"sl","#text":"Slovensko društvo Informatika"},"dc:subject":[{"@xml:lang":"sl","#text":"algoritmi"},{"@xml:lang":"sl","#text":"mnogokotniki"},{"@xml:lang":"sl","#text":"podatkovne strukture"}],"dcterms:temporal":{"@rdf:resource":"1993-2026"},"dc:title":{"@xml:lang":"sl","#text":"Ugotavljanje vsebnosti točk nad posplošenimi mnogokotniki|"},"dc:description":[{"@xml:lang":"sl","#text":"The paper describes an extended algorithm for solving the point-in-polygon problem. The polygon in this case consists of straight edges and al so of circular arcs. This represents a generalization of Reuleaux polygon. The algorithm uses the classical ray intersection method. The difference is that we have two types of geometric objects to test for intersections. Processing is done with simple and efficient tests, which quickly answer our question. Using the appropriate data structure, this task can be done safely and easily. Despite the extension of the classical ray intersection method, the algorithm still runs in linear time complexity"},{"@xml:lang":"sl","#text":"V članku je opisan razširjen algoritem za določanje vsebnosti točk nad posplošenimi mnogokotniki, ki poleg daljic vsebujejo tudi krožne loke. Algoritem uporablja klasično metodo sekanja žarka. Razlika je v tem, da moramo testirati dve vrsti objektov. Nalogo opravimo z enostavnimi in učinkovitimi testi, ki nam hitro odgovorijo na vprašanje. Z uporabo ustreznih podatkovnih struktur nalogo rešimo zanesljivo in enostavno. Kljub razširitvi deluje algoritem še vedno v linearni časovni zahtevnosti"}],"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-IFL9NU9W","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-IFL9NU9W"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-IFL9NU9W/532202af-685c-441d-9ff9-23da517a12b9/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-IFL9NU9W/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-IFL9NU9W"}}}}