@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

psr:-BTNVXP8G-X
  skos:broader psr:-BR5SB1V8-M, psr:-ZTD7VMDS-3 ;
  skos:prefLabel "convex polygon"@en, "polygone convexe"@fr ;
  skos:definition """En géométrie, un polygone convexe est un polygone simple dont l'intérieur est un ensemble convexe. Un polygone simple qui n'est pas convexe est dit concave. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Polygone_convexe">https://fr.wikipedia.org/wiki/Polygone_convexe</a>)"""@fr, """In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a simple polygon (not self-intersecting). Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Convex_polygon">https://en.wikipedia.org/wiki/Convex_polygon</a>)"""@en ;
  a skos:Concept ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Convex_polygon>, <https://fr.wikipedia.org/wiki/Polygone_convexe> ;
  dc:modified "2023-08-16"^^xsd:date ;
  dc:created "2023-08-16"^^xsd:date ;
  skos:inScheme psr: .

psr: a skos:ConceptScheme .
psr:-ZTD7VMDS-3
  skos:prefLabel "analyse convexe"@fr, "convex analysis"@en ;
  a skos:Concept ;
  skos:narrower psr:-BTNVXP8G-X .

psr:-BR5SB1V8-M
  skos:prefLabel "polygone"@fr, "polygon"@en ;
  a skos:Concept ;
  skos:narrower psr:-BTNVXP8G-X .