Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Midpoint polygon"'
Autor:
Vladimir Popov
Publikováno v:
Vestnik Volgogradskogo gosudarstvennogo universiteta. Serija 1. Mathematica. Physica. :85-96
Autor:
Dong-Soo Kim, Seongjin Son, Dae Won Yoon, Kwang Seuk Lee, Kyung Bum Lee, Yoon Il Lee, Jeong Ki Yang
Publikováno v:
Communications of the Korean Mathematical Society. 31:637-645
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Computational Science and Its Applications – ICCSA 2017 ISBN: 9783319623948
ICCSA (2)
ICCSA (2)
Given a convex polygon with n vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertices of such a trian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1704952fedae7f9280442bdbd9d43a59
https://doi.org/10.1007/978-3-319-62395-5_35
https://doi.org/10.1007/978-3-319-62395-5_35
Autor:
Zhongzi Wang, Chao Wang
Publikováno v:
Journal of Knot Theory and Its Ramifications. 28:1950062
For a polygon in the [Formula: see text]-dimensional Euclidean space, we give two kinds of normalizations of its [Formula: see text]th midpoint polygon by a homothetic transformation and an affine transformation, respectively. As [Formula: see text]
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Advanced Materials Research. :4248-4253
A new algorithm for position relationship between detecting point and polygon is proposed based on the research of radial method, and as the first step, transform polygon in convex polygon, then determine the position relationship between detecting p
Publikováno v:
Computational Geometry-Theory and Applications, 44(8), 418-426. Elsevier
We study the problem of reconstructing a simple polygon from angles measured at the vertices of the polygon. We assume that at each vertex v a sensing device returns a list of angles α1,α2,…, where αi is the angle between the i-th and the (i+1)-
Autor:
P. L. Shabalin, R. B. Salimov
Publikováno v:
Russian Mathematics. 53:68-71
In this paper we generalize the Schwarz—Christoffel formula for a conformal mapping of a half-plane onto a certain polygon with infinitely many vertices. We assume that the interior angles of the polygon (at unknown vertices) and the points of the
Autor:
Joseph O'Rourke
Publikováno v:
ACM SIGACT News. 39:58-62
Can a simple spherical polygon always be triangulated? The answer depends on the definitions of "polygon" and "triangulate". Define a spherical polygon to be a simple, closed curve on a sphere S composed of a finite number of great circle arcs (also