Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Doubly_connected_edge_list> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Doubly_connected_edge_list 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.".
- Doubly_connected_edge_list thumbnail Dcel-halfedge-connectivity.svg?width=300.
- Doubly_connected_edge_list wikiPageID "12015290".
- Doubly_connected_edge_list wikiPageLength "3032".
- Doubly_connected_edge_list wikiPageOutDegree "22".
- Doubly_connected_edge_list wikiPageRevisionID "680837433".
- Doubly_connected_edge_list wikiPageWikiLink Algorithm.
- Doubly_connected_edge_list wikiPageWikiLink Category:Geometric_data_structures.
- Doubly_connected_edge_list wikiPageWikiLink Category:Geometric_graph_theory.
- Doubly_connected_edge_list wikiPageWikiLink Category:Graph_data_structures.
- Doubly_connected_edge_list wikiPageWikiLink Computational_geometry.
- Doubly_connected_edge_list wikiPageWikiLink Connected_graph.
- Doubly_connected_edge_list wikiPageWikiLink Connectivity_(graph_theory).
- Doubly_connected_edge_list wikiPageWikiLink Convex_polyhedra.
- Doubly_connected_edge_list wikiPageWikiLink Convex_polytope.
- Doubly_connected_edge_list wikiPageWikiLink Data_structure.
- Doubly_connected_edge_list wikiPageWikiLink Doubly_linked_face_list.
- Doubly_connected_edge_list wikiPageWikiLink Doubly_linked_list.
- Doubly_connected_edge_list wikiPageWikiLink Face_(geometry).
- Doubly_connected_edge_list wikiPageWikiLink Graph_embedding.
- Doubly_connected_edge_list wikiPageWikiLink Planar_graph.
- Doubly_connected_edge_list wikiPageWikiLink Planar_straight-line_graph.
- Doubly_connected_edge_list wikiPageWikiLink Plane_(geometry).
- Doubly_connected_edge_list wikiPageWikiLink Polytope.
- Doubly_connected_edge_list wikiPageWikiLink Quad-edge.
- Doubly_connected_edge_list wikiPageWikiLink Quad-edge_data_structure.
- Doubly_connected_edge_list wikiPageWikiLink Three-dimensional_space.
- Doubly_connected_edge_list wikiPageWikiLink Three-dimensional_space_(mathematics).
- Doubly_connected_edge_list wikiPageWikiLink Vertex_(graph_theory).
- Doubly_connected_edge_list wikiPageWikiLink Voronoi_diagram.
- Doubly_connected_edge_list wikiPageWikiLink Winged_edge.
- Doubly_connected_edge_list wikiPageWikiLink File:Dcel-halfedge-connectivity.svg.
- Doubly_connected_edge_list wikiPageWikiLinkText "Doubly connected edge list".
- Doubly_connected_edge_list wikiPageWikiLinkText "doubly connected edge list".
- Doubly_connected_edge_list hasPhotoCollection Doubly_connected_edge_list.
- Doubly_connected_edge_list wikiPageUsesTemplate Template:Reflist.
- Doubly_connected_edge_list subject Category:Geometric_data_structures.
- Doubly_connected_edge_list subject Category:Geometric_graph_theory.
- Doubly_connected_edge_list subject Category:Graph_data_structures.
- Doubly_connected_edge_list hypernym Structure.
- Doubly_connected_edge_list type Building.
- Doubly_connected_edge_list type Object.
- Doubly_connected_edge_list type Structure.
- Doubly_connected_edge_list 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).".
- Doubly_connected_edge_list label "Doubly connected edge list".
- Doubly_connected_edge_list sameAs Doubly-connected_edge_list.
- Doubly_connected_edge_list sameAs m.02vl_db.
- Doubly_connected_edge_list sameAs xd0x9fxd0xbexd0xb4xd0xb2xd1x96xd0xb9xd0xbdxd0xbe_xd0xb7xd0xb2xd1x8fxd0xb7xd0xb0xd0xbdxd0xb8xd0xb9_xd1x81xd0xbfxd0xb8xd1x81xd0xbexd0xba_xd1x80xd0xb5xd0xb1xd0xb5xd1x80.
- Doubly_connected_edge_list sameAs Q1251544.
- Doubly_connected_edge_list sameAs Q1251544.
- Doubly_connected_edge_list wasDerivedFrom Doubly_connected_edge_list?oldid=680837433.
- Doubly_connected_edge_list depiction Dcel-halfedge-connectivity.svg.
- Doubly_connected_edge_list isPrimaryTopicOf Doubly_connected_edge_list.
