This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-eshttp://es.dbpedia.org/resource/
n6https://global.dbpedia.org/id/
dbpedia-trhttp://tr.dbpedia.org/resource/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n7http://sourceforge.net/projects/polyclipping/files/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Sutherland–Hodgman_algorithm
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Clipping_(computer_graphics)
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Kai_Hormann
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Boolean_operations_on_polygons
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Greiner–Hormann_clipping_algorithm
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Vatti_(disambiguation)
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
dbo:wikiPageDisambiguates
dbr:Vatti_clipping_algorithm
Subject Item
dbr:Vatti_clipping_algorithm
rdfs:label
Vatti clipping algorithm Algoritmo de Vatti
rdfs:comment
El algoritmo de Vatti​ se utiliza en computación gráfica para recortar cualquier número de polígonos de formas arbitrarias. A diferencia de los algoritmos de Sutherland–Hodgman y Weiler–Atherton de recorte de polígonos, el algoritmo de Vatti no restringe los tipos de polígonos que pueden recortarse. Incluso puede recortar polígonos complejos y que se auto-intersectan así como polígonos con agujeros. El algoritmo es generalmente aplicable sólo en el espacio 2D. The Vatti clipping algorithm is used in computer graphics. It allows clipping of any number of arbitrarily shaped subject polygons by any number of arbitrarily shaped clip polygons. Unlike the Sutherland–Hodgman and Weiler–Atherton polygon clipping algorithms, the Vatti algorithm does not restrict the types of polygons that can be used as subjects or clips. Even complex (self-intersecting) polygons, and polygons with holes can be processed. The algorithm is generally applicable only in 2D space.
dcterms:subject
dbc:Polygon_clipping_algorithms
dbo:wikiPageID
27625669
dbo:wikiPageRevisionID
1006994585
dbo:wikiPageWikiLink
dbr:Sweep_line dbr:Clipping_(computer_graphics) dbr:Polygon dbr:Boolean_operations_on_polygons dbr:2D_computer_graphics dbr:Sutherland–Hodgman dbr:Computer_graphics dbr:Bentley–Ottmann_algorithm dbr:Weiler–Atherton dbr:Greiner–Hormann_clipping_algorithm dbc:Polygon_clipping_algorithms
dbo:wikiPageExternalLink
n7:
owl:sameAs
n6:4xJ8u yago-res:Vatti_clipping_algorithm freebase:m.0c3_rkt wikidata:Q7917212 dbpedia-es:Algoritmo_de_Vatti dbpedia-tr:Vatti_kırpma_algoritması
dbp:wikiPageUsesTemplate
dbt:Compu-graphics-stub dbt:Reflist
dbo:abstract
El algoritmo de Vatti​ se utiliza en computación gráfica para recortar cualquier número de polígonos de formas arbitrarias. A diferencia de los algoritmos de Sutherland–Hodgman y Weiler–Atherton de recorte de polígonos, el algoritmo de Vatti no restringe los tipos de polígonos que pueden recortarse. Incluso puede recortar polígonos complejos y que se auto-intersectan así como polígonos con agujeros. El algoritmo es generalmente aplicable sólo en el espacio 2D. The Vatti clipping algorithm is used in computer graphics. It allows clipping of any number of arbitrarily shaped subject polygons by any number of arbitrarily shaped clip polygons. Unlike the Sutherland–Hodgman and Weiler–Atherton polygon clipping algorithms, the Vatti algorithm does not restrict the types of polygons that can be used as subjects or clips. Even complex (self-intersecting) polygons, and polygons with holes can be processed. The algorithm is generally applicable only in 2D space.
prov:wasDerivedFrom
wikipedia-en:Vatti_clipping_algorithm?oldid=1006994585&ns=0
dbo:wikiPageLength
2580
foaf:isPrimaryTopicOf
wikipedia-en:Vatti_clipping_algorithm
Subject Item
dbr:Weiler–Atherton_clipping_algorithm
dbo:wikiPageWikiLink
dbr:Vatti_clipping_algorithm
Subject Item
wikipedia-en:Vatti_clipping_algorithm
foaf:primaryTopic
dbr:Vatti_clipping_algorithm