The Euler Characteristic in Combinatorial Geometry
From MaRDI portal
Cited in
(22)- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
- A Mazur-Orlicz type theorem for submodular set functions
- Families of convex sets having convex union
- Valuations and polarity
- Zur Eulerschen Charakteristik allgemeiner, insbesondere konvexer Polyeder
- Die Euler-Charakteristik von Vereinigungen konvexer Mengen im R
- Zur Einführung der Eulerschen Charakteristik und Begründung des Satzes von Euler-Schläfli
- On the realization of convex polytopes, Euler's formula and Möbius functions
- Characteristic for reflexive relations
- Helly and Klee type intersection theorems for finitary connected paved spaces
- On the Euler characteristic in spaces with a separability property
- On the Euler characteristic of finite unions of convex sets
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- Mengenalgebra und Eulersche Charakteristik
- Eulersche Charakteristik, Projektionen und Quermassintegrale. (Euler characteristics, projections and mean cross-sectional measures.)
- Erweiterter Polyedersatz und Euler-Shephardsche Additionstheoreme
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- On a generalization of Zaslavsky's theorem for hyperplane arrangements
- On the Euler characteristic of spherical polyhedra and the Euler relation
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Klee's intersection theorem for separated paved spaces
- Valuations on distributive lattices. I, II, III
This page was built for publication: The Euler Characteristic in Combinatorial Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5328626)