A quad-edge data structure is a computer representation of the topology of a two-dimensional or three-dimensional map, that is, a graph drawn on a (closed) surface.
| Property | Value |
|---|---|
| dbpedia-owl:abstract |
|
| dbpedia-owl:wikiPageExternalLink | |
| dcterms:subject | |
| rdfs:comment |
|
| rdfs:label |
|
| owl:sameAs | |
| foaf:page | |
| is dbpedia-owl:wikiPageRedirects of | |
| is owl:sameAs of | |
| is foaf:primaryTopic of |
