Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
Displaying similar documents to “On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors.”
Triangulating Point Sets in Space.
A Proof of Bárány's Theorem
Žana Kovijanić (1994)
Publications de l'Institut Mathématique
Similarity:
On the planarity of 2-complexes
Frank Harary, Ronald H. Rosen (1976)
Colloquium Mathematicae
Similarity:
e-Nets and Simplex Range Queries.
D. Haussler, Emo Welzl (1987)
Discrete & computational geometry
Similarity:
Ceva's and Menelaus' theorems for the -dimensional space.
Buba-Brzozowa, Malgorzata (2000)
Journal for Geometry and Graphics
Similarity:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
Simplicial nonpositive curvature
Tadeusz Januszkiewicz, Jacek Świątkowski (2006)
Publications Mathématiques de l'IHÉS
Similarity:
We introduce a family of conditions on a simplicial complex that we call local -largeness (≥6 is an integer). They are simply stated, combinatorial and easily checkable. One of our themes is that local 6-largeness is a good analogue of the non-positive curvature: locally 6-large spaces have many properties similar to non-positively curved ones. However, local 6-largeness neither implies nor is implied by non-positive curvature of the standard metric. One can think of these results as...
Optimality of the Delaunay Triangulation in Rd .
V.T. Rajan (1994)
Discrete & computational geometry
Similarity:
Oriented Matroids with Few Mutations.
G.M. Ziegler, N.E. Mnëv (1993)
Discrete & computational geometry
Similarity:
Two Constructions of Oriented Matroids with Disconnected Extension Space.
J. Richter-Gebert, N.E. Mnëv (1993)
Discrete & computational geometry
Similarity:
On simplicial red refinement in three and higher dimensions
Korotov, Sergey, Křížek, Michal
Similarity:
We show that in dimensions higher than two, the popular "red refinement" technique, commonly used for simplicial mesh refinements and adaptivity in the finite element analysis and practice, never yields subsimplices which are all acute even for an acute father element as opposed to the two-dimensional case. In the three-dimensional case we prove that there exists only one tetrahedron that can be partitioned by red refinement into eight congruent subtetrahedra that are all similar to...
Brouwer Fixed Point Theorem for Simplexes
Karol Pąk (2011)
Formalized Mathematics
Similarity:
In this article we prove the Brouwer fixed point theorem for an arbitrary simplex which is the convex hull of its n + 1 affinely indepedent vertices of εn. First we introduce the Lebesgue number, which for an arbitrary open cover of a compact metric space M is a positive real number so that any ball of about such radius must be completely contained in a member of the cover. Then we introduce the notion of a bounded simplicial complex and the diameter of a bounded simplicial complex....