Results 11 to 20 of about 704,101 (306)
International Journal of Mathematics and Mathematical Sciences, 2005 Given a bounded sequence of integers {d0,d1,d2,…}, 6≤dn≤M, there is an associated abstract triangulation created by building up layers of vertices so that vertices on the nth layer have degree dn.
David Dennis, G. Brock Williams
doaj +2 more sources
Online Circle and Sphere Packing [PDF]
Theoretical Computer Science, 2017 In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes.
Lintzmayer, Carla Negri +2 more
core +3 more sources
The Apollonian Packing of Circles [PDF]
Proceedings of the National Academy of Sciences, 1943 Not ...
Kasner, Edward, Supnick, Fred
openaire +3 more sources
Hybrid Rockets as Post-Boost Stages and Kick Motors
Aerospace, 2021 Hybrid rockets are attractive as post-boost stages and kick motors due to their inherent safety and low cost, but it is not clear from previous research which oxidizer is most suitable for maximizing ΔV within a fixed envelope size, or what impact O/F ...
Landon Kamps +2 more
doaj +1 more source
Physiologic Flow Diversion Coiling Technique for Wide-Necked Aneurysms with an Asymmetric Bidirectional Flow at the Aneurysm Neck [PDF]
Neurointervention, 2022 Purpose Wide-necked aneurysms in the circle of Willis (CoW) are prone to recur due to reciprocal bidirectional flow. We present a novel concept of coil embolization to prevent recurrence that uses physiologic flow diversion at the CoW.
Boseong Kwon +3 more
doaj +1 more source
Negative (and positive) circles in signed graphs: A problem collection
AKCE International Journal of Graphs and Combinatorics, 2018 A signed graph is a graph whose edges are labeled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles. Here I describe
Thomas Zaslavsky
doaj +2 more sources
PLoS ONE, 2022 The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore
He Ren, Rui Zhong
doaj +2 more sources
Some criteria for circle packing types and combinatorial Gauss-Bonnet theorem [PDF]
Transactions of the American Mathematical Society, 2020 We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem involving boundary ...
Byung-Geun Oh
semanticscholar +1 more source
On the Improvement of the Heuristic Algorithm for Packing Circles into a Circle of Minimum Radius
Кібернетика та комп'ютерні технології, 2023 The article is devoted to investigation of a heuristic algorithm for solving the competitive problem "Circles Dense packing into a circle of minimum radius" and development of its improved version using Shor's r-algorithm with step dichotomy.
Bohdan Zadorozhnyi +2 more
doaj +1 more source
QUADRILATERAL MESHING BY CIRCLE PACKING [PDF]
International Journal of Computational Geometry & Applications, 2000 We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements form the cells of a Voronoï diagram, (2) all elements have two opposite 90° angles, (3) all elements are kites, or
Marshall W. Bern, David Eppstein
openaire +3 more sources