Results 31 to 40 of about 6,328 (160)
UNFOLDED REGULAR AND SEMI-REGULAR POLYHEDRA
Journal of Industrial Design and Engineering Graphics, 2015 This paper proposes a presentation unfolding regular and semi-regular polyhedra. Regular polyhedra are convex polyhedra whose faces are regular and equal polygons, with the same number of sides, and whose polyhedral angles are also regular and equal ...
Elena Ionita +2 more
doaj +4 more sources
Linear best method for recovering the second derivatives of Hardy class functions [PDF]
E3S Web of Conferences, 2020 The linear best method for approximating the second derivatives of Hardy class functions defined in the unit circle at zero in accordance with the information about their values in a finite number of points forming a regular polygon is found.
Ovchintsev Mikhail
doaj +1 more source
Random Polygons and Estimations of π
Open Mathematics, 2019 In this paper, we study the approximation of π through the semiperimeter or area of a random n-sided polygon inscribed in a unit circle in ℝ2. We show that, with probability 1, the approximation error goes to 0 as n → ∞, and is roughly sextupled when ...
Xu Wen-Qing, Meng Linlin, Li Yong
doaj +1 more source
Multi-robot control for a static polygon formation using Neighbor-Leader algorithm
Journal of King Saud University: Computer and Information Sciences, 2022 One of the biggest open challenges to the robotic system is controlling robots formation. Its importance has been noted in a wide variety of applications, from truck platoons to robot-based standalone parcel delivery.
Bayadir A. Issa +1 more
doaj +1 more source
Buckling loads of columns of regular polygon cross-section with constant volume and clamped ends
Electronic Journal of Structural Engineering, 2002 A numerical method is developed for calculating the buckling loads of tapered columns of regular polygon cross-section with constant volume and both clamped ends. The linear, parabolic and sinusoidal tapers are considered in numerical examples. From the
Byoung Koo Lee, Sang Jin Oh, Guangfan Li
doaj
SIAM Journal on Discrete Mathematics, 2017 In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the gap between the current bounds, we introduce a new upper bound for their boolean rank, deriving from it some new ...
Goucha, António Pedro +2 more
openaire +2 more sources
Journal of High Energy Physics, 2020 We investigate the lattice ℂP N−1 sigma model on S s 1 $$ {S}_s^1 $$ (large) × S τ 1 $$ {S}_{\tau}^1 $$ (small) with the ℤ N symmetric twisted boundary condition, where a sufficiently large ratio of the circumferences (L s ≫ L τ ) is taken to approximate
Toshiaki Fujimori +4 more
doaj +1 more source
Regular meshes from polygonal patterns
ACM Transactions on Graphics, 2017 We present a framework for designing shapes from diverse combinatorial patterns, where the vertex 1-rings and the faces are as rotationally symmetric as possible, and define such meshes as regular. Our algorithm computes the geometry that brings out the symmetries encoded in the combinatorics. We then allow designers and artists to envision and realize
Vaxman, Amir +2 more
openaire +3 more sources
Applied Mathematics Letters, 1998 Let a convex polygon \(P\) be approximated by a regular polygon \(R_n\) with \(n\) sides such that the area of their symmetric difference, i.e. the region that belongs to exactly one of them, is as small as possible. The author further assumes \(R_n\) to have the same perimeter as \(P\).
openaire +1 more source
Some contributions to Regular Polygons
, 2016 9 pages, 4 ...
ÖNCEL, Deniz, KİRİŞÇİ, Murat
openaire +3 more sources