%0 Conference Paper %B Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing %D 2004 %T A data structure for non-manifold simplicial d-complexes %A De Floriani, Leila %A Greenfieldboyce,David %A Hui,Annie %X We propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of boundary and partial co-boundary topological relations. It is a dimension-independent data structure in the sense that it can represent objects of arbitrary dimensions. It scales well to the manifold case, i.e. it exhibits a small overhead when applied to simplicial complexes with a manifold domain, Here, we present efficient navigation algorithms for retrieving all topological relations from a SIG, and an algorithm for generating a SIG from a representation of the complex as an incidence graph. Finally, we compare the simplified incidence graph with the incidence graph, with a widely-used data structure for d-dimensional pseudo-manifold simplicial complexes, and with two data structures specific for two-and three-dimensional simplicial complexes. %B Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing %S SGP '04 %I ACM %C New York, NY, USA %P 83 - 92 %8 2004/// %@ 3-905673-13-4 %G eng %U http://doi.acm.org/10.1145/1057432.1057444 %R 10.1145/1057432.1057444