2012
DOI: 10.1007/978-94-007-4174-4_4
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…Meanwhile, the secondary topological entities are partial entities called partial face (p-face), partial edge (p-edge) and partial vertex (p-vertex). The partial entity data structure considers each face to have one orientation geometrically defined based on its face normal, and the orientation of its boundary can thus be uniquely defined [48]. Basic query procedures are used to extract the adjacency relationship between the basic topological entities.…”
Section: Three-dimensional (3d) Spatial Modeling and Data Structurementioning
confidence: 99%
See 1 more Smart Citation
“…Meanwhile, the secondary topological entities are partial entities called partial face (p-face), partial edge (p-edge) and partial vertex (p-vertex). The partial entity data structure considers each face to have one orientation geometrically defined based on its face normal, and the orientation of its boundary can thus be uniquely defined [48]. Basic query procedures are used to extract the adjacency relationship between the basic topological entities.…”
Section: Three-dimensional (3d) Spatial Modeling and Data Structurementioning
confidence: 99%
“…Basic query procedures are used to extract the adjacency relationship between the basic topological entities. The difference with the coupling entity data structure is that the partial entity data structure kept the relationship of the objects that were connected by a vertex and, as stated by [48], this data structure saves more storage cost than the Radial Edge data structure for non-manifold cell 2-complexes. Cell-tuple data structure [42] has a combination of nodes, edges, faces, and solids.…”
Section: Three-dimensional (3d) Spatial Modeling and Data Structurementioning
confidence: 99%
“…A linear cell complex is the special case of a CW complex, whose attaching maps are homeomorphisms and whose cells are polyhedra [16]. Cell complexes are used in applications such as computer graphics, Computer Aided Design (CAD) and geographic in order to discretise 3D geometric objects [17].…”
Section: Linear Cell Complexes and Combinatorial Mapsmentioning
confidence: 99%
“…An additional coordinate indicates a scale factor that is applied to all other coordinates. data structures and representation schemes Čomić & de Floriani (2012); Arroyo Ohori, Ledoux & Stoter (2015b). Possible approaches include incidence graphs (Rossignac & O'Connor, 1989;Masuda, 1993;Sohanpanah, 1989;Hansen & Christensen, 1993), Nef polyhedra Bieri & Nef (1988), and ordered topological models Brisson (1993); Lienhardt (1994).…”
Section: Higher-dimensional Modelling Of Space Time and Scalementioning
confidence: 99%