Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1251544> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Q1251544 subject Q7035968.
- Q1251544 subject Q8488077.
- Q1251544 subject Q8498905.
- Q1251544 abstract "The doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces). It is used in many algorithms of computational geometry to handle polygonal subdivisions of the plane, commonly called planar straight-line graphs (PSLG). For example, a Voronoi diagram is commonly represented by a DCEL inside a bounding box. This data structure was originally suggested by Muller and Preparata for representations of 3D convex polyhedra. Later a somewhat different data structuring was suggested, but the name "DCEL" was retained.For simplicity, only connected graphs are considered, however the DCEL structure may be extended to handle disconnected graphs as well.".
- Q1251544 thumbnail Dcel-halfedge-connectivity.svg?width=300.
- Q1251544 wikiPageWikiLink Q1304193.
- Q1251544 wikiPageWikiLink Q17285.
- Q1251544 wikiPageWikiLink Q175263.
- Q1251544 wikiPageWikiLink Q230655.
- Q1251544 wikiPageWikiLink Q3064117.
- Q1251544 wikiPageWikiLink Q34929.
- Q1251544 wikiPageWikiLink Q4129097.
- Q1251544 wikiPageWikiLink Q5300176.
- Q1251544 wikiPageWikiLink Q5300179.
- Q1251544 wikiPageWikiLink Q547823.
- Q1251544 wikiPageWikiLink Q5597085.
- Q1251544 wikiPageWikiLink Q5926443.
- Q1251544 wikiPageWikiLink Q7035968.
- Q1251544 wikiPageWikiLink Q7200964.
- Q1251544 wikiPageWikiLink Q7268250.
- Q1251544 wikiPageWikiLink Q747980.
- Q1251544 wikiPageWikiLink Q757267.
- Q1251544 wikiPageWikiLink Q8366.
- Q1251544 wikiPageWikiLink Q8488077.
- Q1251544 wikiPageWikiLink Q8498905.
- Q1251544 wikiPageWikiLink Q874709.
- Q1251544 comment "The doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces). It is used in many algorithms of computational geometry to handle polygonal subdivisions of the plane, commonly called planar straight-line graphs (PSLG).".
- Q1251544 label "Doubly connected edge list".
- Q1251544 depiction Dcel-halfedge-connectivity.svg.
