Results 71 to 80 of about 4,255,094 (265)
Moduli space of simple polygons
, 2023 In this work we study the space S(n) of positively oriented, simple n-gons with labeled vertices up to oriented similarity and M(n) the moduli space of simple n-gons as a quotient of S(n). We give a local description of S(n) and M(n) around the regular n-gon and describe completely the two spaces when n = 4 using a topological Morse function.
González, Ahtziri +1 more
openaire +2 more sources
Locked and Unlocked Polygonal Chains in 3D [PDF]
, 1998 In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each ...
Biedl, T. +10 more
core +8 more sources
On the Tileability of Polygons with Colored Dominoes
Discrete Mathematics & Theoretical Computer Science, 2007 We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable $2 imes 1$ rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color ...
Chris Mark Worman, Boting Yang
doaj
Programación Matemática y SoftwareIn industrial applications such as CAD modeling, manufacture or automated systems, it is common to work with data models that are represented by polygonal shapes, or models that produce polygonal shapes out of complex geometry defined by lines and ...
Yuriy Kotsarenko
doaj +1 more source
NLP Formulation for Polygon Optimization Problems
Mathematics, 2018 In this paper, we generalize the problems of finding simple polygons with minimum area, maximum perimeter, and maximum number of vertices, so that they contain a given set of points and their angles are bounded by α + π where α
Saeed Asaeedi +2 more
doaj +1 more source
Frontiers in Psychology, 2014 In three experiments we manipulated the resolution of novel complex objects in visual working memory (WM) by changing task demands. Previous studies that investigated the trade-off between quantity and resolution in visual WM yielded mixed results for ...
Ayala S Allon +3 more
doaj +1 more source
, 2012 We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set of disjoint line segments in the plane admits a binary tree.
openaire +2 more sources
New Concept for Articulated Alar Rim Graft Positioning
Plastic and Reconstructive Surgery, Global OpenSummary:. The articulated alar rim graft (AARG) proposed by Davis is a simple and effective method for avoiding and correcting most alar rim deformities in rhinoplasty.
Tiago Lyrio, MD +4 more
doaj +1 more source
Pick’s Theorem in Two-Dimensional Subspace of R3
The Scientific World Journal, 2015 In the Euclidean space R3, denote the set of all points with integer coordinate by Z3. For any two-dimensional simple lattice polygon P, we establish the following analogy version of Pick’s Theorem, kIP+1/2BP-1, where BP is the number of lattice points ...
Lin Si
doaj +1 more source
Geometric descriptions of polygon and chain spaces
, 2007 We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m
Hausmann, Jean-Claude
core +2 more sources