Results 31 to 40 of about 7,242 (307)
METHODS FOR CONSTRUCTION OF ODD NUMBER POINTED POLYGONS
Journal of Industrial Design and Engineering Graphics, 2016 The purpose of this paper is to present methods for constructing of polygons with an odd number of sides, although some of them may not be built only with compass and straightedge.
Daniel Dobre
doaj +4 more sources
When is a polygon circumscribing a regular polygon again regular?
, 1993 Let \({\mathcal A}\) be a regular \(n\)-gon with vertices \(A_ 1,A_ 2,\ldots,A_ n\) and edge-length =1, which is inscribed in \({\mathcal P}\), an \(n\)-gon with vertices \(P_ 1,P_ 2,\ldots,P_ n\), in such a way that \(A_ 1P_ 1=A_ 2P_ 2=\cdots=A_ nP_ n\). The main results of this paper are given in the following theorem. Theorem 1. If \(n=3\) or 4 or \(
Bennish, J., Gau, Y.D.
openaire +2 more sources
Double pyramidal central configurations of Newtonian (N+2)-body problem
Results in PhysicsFor double pyramidal central configurations of the Newtonian (N+2)-body problem where N point particles are positioned at the vertices of a regular N-polygon, and the (N+1)-th and (N+2)-th point-particles are positioned the opposite sides of the plane ...
Liang Ding, Jinrong Wang, Jinlong Wei
doaj +1 more source
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 +2 more sources
Generalized Petersen graphs and Kronecker covers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The family of generalized Petersen graphs $G(n,k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. The
Matjaž Krnc, Tomaž Pisanski
doaj +1 more source
The billiard in a regular polygon
Geometric and Functional Analysis, 1992 Let \(P_ n\) be a regular \(n\)-gon. From the Ikehara Tauberian theorem one infers that there exists \(c_ n > 0\) such that the growth function of the length spectrum of the billiard in \(P_ n\) satisfies the asymptotic formula: \[ N(P_ n,t)\sim c_ n{t^ 2\over\| P_ n\|}\qquad (t\to \infty)\quad (\| P\|=\text{area}(P_ n)).\tag{1} \] The values \(c_ 3 ...
openaire +2 more sources
CQD Revista Eletrônica Paulista de MatemáticaEstimating the apothem of regular polygons may be required in academical and real-life situations such as for calculating the area of regular polygons and the volume of prisms and pyramids.
Sergio Roberto Peres Line +1 more
doaj +1 more source
Subgrain and Cavity Development during Creep of Al‐3.85%Mg
Advanced Engineering Materials, EarlyView.Al‐3.85%Mg does form subgrains if crept at very high strains. This fact allows the unification of the creep description in two different alloys such as pure Al and Al–Mg alloys. It is classically considered that the creep mechanisms for type M (e.g., pure Al) and type A alloys (e.g., Al–Mg alloys) are different.
Augusta Isaac +6 more
wiley +1 more source
The Evolution of the Local Induction Approximation for a Regular Polygon *
ESAIM: Proceedings and Surveys, 2014 In this paper, we consider the so-called local induction approximation (LIA): $$ \Xt = \Xs\wedge\Xss, $$ X
de la Hoz Francisco, Vega Luis
doaj +1 more source
Research about the number of D-points of -tiling in given ellipse
Journal of Hebei University of Science and Technology, 2017 An Archimedean tiling is a tiling of the plane by one type of regular polygon or several types of regular polygons, and every vertex of the tiling has the same vertex characteristics.
Xianglin WEI, Weiqi WANG
doaj +1 more source