Results 31 to 40 of about 76,092 (311)
Development of Comic Mathematics Learning Media Based on Contextual Approaches
Jurnal Ilmiah Pendidikan Matematika, 2020 The development of teaching materials or instructional media that are tailored to the characteristics of students is considered important at this time. For this reason, this study aims to develop comic-shaped mathematics learning media based on a valid ...
Erdawati Nurdin +2 more
doaj +1 more source
A Pseudopolynomial Algorithm for Alexandrov's Theorem [PDF]
, 2008 Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron.
A.D. Alexandrov +6 more
core +3 more sources
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm [PDF]
, 2011 We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts.
D.D. Sleator +6 more
core +3 more sources
On the section of a convex polyhedron
Discrete Mathematics, 1995 Let \(P\) be a convex polyhedron in \(\mathbb{R}^3\), and \(E\) be a plane cutting \(P\). The authors establish the sharp inequality \[ \text{perimeter} (P \cap E) < {2 \over 3} L(P), \] where \(L(P)\) denotes the sum of the edge-lengths of \(P\). To prove the result, they project the polyhedron \(P\) orthogonally into the plane \(E\) and compare the ...
Hiroshi Maehara +2 more
openaire +2 more sources
Data-based polyhedron model for optimization of engineering structures involving uncertainties
Data-Centric Engineering, 2021 This paper studies the data-based polyhedron model and its application in uncertain linear optimization of engineering structures, especially in the absence of information either on probabilistic properties or about membership functions in the fussy sets-
Zhiping Qiu +3 more
doaj +1 more source
Algebraic vertices of non-convex polyhedra [PDF]
, 2017 In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron.
Akopyan, Arseniy +2 more
core +2 more sources
Structure of the {U13} polyoxo cluster U13O8Clx(MeO)38–x (x = 2.3, MeO = methoxide)
Acta Crystallographica Section E: Crystallographic Communications, 2021 The structure of a new type of polyoxo cluster complex that contains thirteen uranium atoms, {U13}, is reported. The complex crystallized from methanol containing tetravalent uranium (UIV) with a basic organic ligand, and was characterized as ...
Sebastian Fichter +2 more
doaj +1 more source
The Representation Polyhedron of a Semiorder [PDF]
Order, 2011 Let a nite semiorder, or unit interval order, be given. All its numerical representa- tions (when suitably dened) form a convex polyhedron. We show that the facets of the representation polyhedron correspond to the noses and hollows of the semiorder. Our main result is to prove that the coordinates of the vertices and the components of the extreme rays
Balof, Barry +2 more
openaire +2 more sources
Combinatorial Lemmas for Polyhedrons
Discussiones Mathematicae Graph Theory, 2005 Summary: We formulate general boundary conditions for a labelling to assure the existence of a balanced \(n\)-simplex in a triangulated polyhedron. Furthermore we prove a Knaster-Kuratowski-Mazurkiewicz type theorem for polyhedrons and generalize some theorems of Ichushi and Idzik.
Adam Idzik, Konstanty Junosza-Szaniawski
openaire +2 more sources
Polyhedral realisation of hyperbolic metrics with conical singularities on compact surfaces [PDF]
, 2006 A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly).
Fillastre, François
core +5 more sources