• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Polygon triangulation     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatPolygons, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:Abstraction100002137yago:Act100030358yago:Activity100407535yago:Algorithm105847438yago:Attribute100024264yago:Communication100033020yago:Event100029378yago:Figure113862780yago:Graph107000195yago:PlaneFigure113863186yago:Polygon113866144yago:Procedure101023820yago:PsychologicalFeature100023100yago:WikicatGeometricAlgorithmsyago:WikicatGeometricGraphsyago:YagoPermanentlyLocatedEntityyago:Rule105846932yago:Shape100027807yago:VisualCommunication106873252yago:WikicatPolygons New Facet based on Instances of this Class

In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P. Triangulations may be viewed as special cases of planar straight-line graphs. When there are no holes or added points, triangulations form maximal outerplanar graphs.