@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00751492v2> a dcat:Dataset ;
    dct:description """
              A new algorithm is presented, which computes the number of lattice points lying inside a convex plane polygon from the sequence of the rational coordinates of its vertices. It reduces the general case in a natural way to a fondamental one, namely a triangle with vertices of coordinates $\\{(0;0),(n;0),(n;n\\frac{a}{b})\\}$, where $n$, $a$ and $b$ are positive natural integers. Then it evaluates the discrete area of such a triangle using the Klein polyhedron of slope $\\frac{a}{b}$ and the Ostrowski representation of $n$ with the numeration scale of denominators of the convergents of the continued fraction expansion of $\\frac{a}{b}$ .
            """ ;
    dct:identifier "hal-00751492" ;
    dct:issued "2026-05-14T15:10:47.806144"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-14T15:10:47.806150"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "A New Algorithm for Discrete Area of Convex Polygons with Rational Vertices" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00751492v2/resource/d0249624-6292-4de1-aab0-e4bf7a5ed69d> ;
    dcat:keyword "counting",
        "infoeu-reposemanticspreprint",
        "infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm",
        "klein-polyhedra",
        "lattice-points",
        "preprints-working-papers-",
        "rational-polygon" ;
    dcat:landingPage <https://hal.science/hal-00751492> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00751492v2/resource/d0249624-6292-4de1-aab0-e4bf7a5ed69d> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-14T15:10:47.814224"^^xsd:dateTime ;
    dct:modified "2026-05-14T15:10:47.789545"^^xsd:dateTime ;
    dct:title "A New Algorithm for Discrete Area of Convex Polygons with Rational Vertices" ;
    dcat:accessURL <https://hal.science/hal-00751492> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00751492> a foaf:Document .