Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Doubly_connected_edge_list> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Doubly_connected_edge_list abstract "The doubly connected edge list (DCEL) 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 wikiPageRevisionID "544850138".
- Doubly_connected_edge_list hasPhotoCollection Doubly_connected_edge_list.
- 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 type Abstraction100002137.
- Doubly_connected_edge_list type Arrangement105726596.
- Doubly_connected_edge_list type Cognition100023271.
- Doubly_connected_edge_list type DataStructure105728493.
- Doubly_connected_edge_list type GeometricDataStructures.
- Doubly_connected_edge_list type GraphDataStructures.
- Doubly_connected_edge_list type PsychologicalFeature100023100.
- Doubly_connected_edge_list type Structure105726345.
- Doubly_connected_edge_list comment "The doubly connected edge list (DCEL) 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 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 Q1251544.
- Doubly_connected_edge_list sameAs Q1251544.
- Doubly_connected_edge_list sameAs Doubly_connected_edge_list.
- Doubly_connected_edge_list wasDerivedFrom Doubly_connected_edge_list?oldid=544850138.
- Doubly_connected_edge_list depiction Dcel-halfedge-connectivity.svg.
- Doubly_connected_edge_list isPrimaryTopicOf Doubly_connected_edge_list.