Results 11 to 20 of about 17,391 (302)
Circle packing with generalized branching [PDF]
The Journal of Analysis, 2016 Attempts to build a discrete theory for rational maps on the sphere via circle packing have foundered on discretization effects in locating branch points. The authors remove this impediment by introducing generalized branch points. A generalized branch point need no longer be attached to an individual circle, but with the help of chaperones and other ...
James Ashe +2 more
openaire +7 more sources
Exploring Circle Packing Algorithms. [PDF]
, 2016 We present an interactive tool for visualizing and experimenting with different circle packing algorithms.
Kevin Pratt +2 more
openaire +5 more sources
Circle-packing-based layout [PDF]
, 2022 The code for computing the layout of the circle-packing-based architecture ...
Mengchen Liu +3 more
core +1 more source
Circle packing in arbitrary domains: supplemental material [PDF]
, 2023 This document contains the supplemental material of our paper, "Circle packing in arbitrary domains". It is meant to provide an illustration of the algorithm that we have devised, and it allows to deal with arbitrary domains.
Damian de la Cruz +4 more
core +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
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
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
Counter examples to invariant circle packing [PDF]
, 2022 International audienceIn this work, a unimodular random planar triangulation is constructed that has no invariant circle packing. This disputes a problem asked in [9].
Khezeli, Ali
core +1 more source
Online circle and sphere packing [PDF]
Theoretical Computer Science, 2018 In the Online Circle Packing in Squares, circles arrive one at a time and we need to pack them into the minimum number of unit square bins. We improve the previous best-known competitive ratio for the bounded space version from 2.439 to 2.3536 and we also give an unbounded space algorithm.
Carla Negri Lintzmayer +2 more
openaire +3 more sources
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