Skip to main content

Simplicial Complex

  • Reference work entry
Encyclopedia of Database Systems
  • 300 Accesses

Synonyms

CW complex; Polyhedron; Cell complex

Definition

A simplicial complex is a topological space constructed by gluing together dimensional simplices (points, line segments, triangles, tetrahedrons, etc.).

A simplicial complex K is a set of simplices k, which satisfies the two conditions:

  1. 1.

    Any face of a simplex in K is also in K

  2. 2.

    The intersection of any two simplices in K is a face of both simplices (or empty)

Historical Background

Raster (field) or vector (object) are the two dominant conceptualizations of space. Applications focusing on object with 2 or 3 dimensional geometry structure the storage of geometry as points, lines, surfaces, and volumes and the relations between them; a classical survey paper discussed the possible approaches mostly from the perspective of Computer Aided Design (CAD) where individual physical objects are constructed [10].

The representation of geographic information, e.g., maps, introduces consistency constraints between the objects; consider the...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Alexandrov P.S. Combinatorial Topology Volumes 1, 2 and 3. Dover Publications, Inc., Mineola, New York, 1960.

    Google Scholar 

  2. Corbett J.P. Topological Principles in Cartography, Bureau of the Census, US Department of Commerce, 1979.

    Google Scholar 

  3. Egenhofer M. and Herring J.R. A mathematical framework for the definition of topological relationships. In Proc. Fourth Int. Symp. on Spatial Data Handling, 1990.

    Google Scholar 

  4. Egenhofer M.J. and Franzosa R.D. On the equivalence of topological relations. Int. J. Geogr. Inf. Syst., 9(2):133–152, 1995.

    Google Scholar 

  5. Frank A.U. and Kuhn W. Cell graph: a provable correct method for the storage of geometry. In Proc. Second Int. Symp. on Spatial Data Handling, 1986.

    Google Scholar 

  6. Guibas L.J. and Stolfi J. A language for bitmap manipulation. ACM Trans. Grap., 1(3):191–214, 1982.

    Google Scholar 

  7. Härder T. New approaches to object processing in engineering databases. In Proc. 1986 Int. Workshop on Object-Oriented Database Systems, 1986.

    Google Scholar 

  8. Levin B. Objecthood: an event structure perspective. In Proc. Chicago Linguistic Society 35, 1999, pp. 223–247.

    Google Scholar 

  9. Lienhardt P. Extensions of the notion of map and subdivision of a three-dimensional space. In Proc. 5th Annual Symp. on Theoretical Aspects of Computer Science, 1988.vol. 294,

    Google Scholar 

  10. Requicha A. Representation for rigid solids: theory, methods and Systems. ACM Comp. Surv., 12(4):437–464, 1980.

    Google Scholar 

  11. T, et al. (eds.) Sellis (2003). Spatiotemporal Databases: The Chorochronos Approach. LNCS, Springer, Berlin, .vol. 2520.

    Google Scholar 

  12. Thompson R.J. Towards a Rigorous Logic for Spatial Data Representation. Doctoral thesis, Delft, NCG, 2007.

    Google Scholar 

  13. Timpf S. 1998.Hierarchical Structures in Map Series. Technical University Vienna, Vienna, Ph.D thesis,

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Frank, A.U. (2009). Simplicial Complex. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_345

Download citation

Publish with us

Policies and ethics