Results 11 to 20 of about 79,019 (293)
IDENTIFICATION OF STUDENTS’ WORK IN RESOLVING THE PROBLEM OF POLYHEDRON
Kalamatika, 2020 The research aims to identify students ' work in resolving the problem of polyhedron. This research used a qualitative descriptive method conducted at the state Junior High School in Batujajar.
Samsul Faridz +2 more
doaj +1 more source
Finding the Largest Volume Parallelepipedon of Arbitrary Orientation in a Solid
IEEE Access, 2021 3D Computer Vision algorithms are a subject of research and application for several industrial processes. The Volume of Interest (VOI) usually refer to sub-objects with basic shapes for computing these algorithms.
Ruben Molano +7 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
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
MAIN DIRECTIONS IN GEOMETRIC SHAPING OF REGULAR DISCRETE STRUCTURES IN DESIGN
Архитектон, 2021 The article expands on some important aspects in the geometric shaping of regular discrete structures in different areas of design and architecture and outlines main promising directions for their development.
Korotich Andrey V.
doaj +1 more source
Multi-criteria comparison of 220 kV switchgears which have different circuits of electrical connections [PDF]
E3S Web of Conferences, 2023 The paper compares different open 220 kV switchgears in the context of a new complex solution offered by the author. The solution is a polyhedron circuit topology switchgear with novel scheme and arrangement approaches.
Grinev Nikolai
doaj +1 more source
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
Topological n-cells and Hilbert cubes in inverse limits
Applied General Topology, 2018 It has been shown by S. Mardešić that if a compact metrizable space X has dim X ≥ 1 and X is the inverse limit of an inverse sequence of compact triangulated polyhedra with simplicial bonding maps, then X must contain an arc. We are going to prove that
Leonard R. Rubin
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
Nanomaterials, 2016 Crystalline nanoparticles or nanoprecipitates with a cubic structure often have near polyhedral shapes composed of low-index planes with {100}, {111} and {110}. To consider such near polyhedral shapes, algebraic formulas of extended superspheres that can
Susumu Onaka
doaj +1 more source