Disk packing for the estimation of the size of a wire bundle
From MaRDI portal
Publication:1764345
DOI10.1007/BF03167582zbMath1126.52300MaRDI QIDQ1764345
Deok-Soo Kim, Hiroaki Sano, Donguk Kim, Masayoshi Sawai, Kōkichi Sugihara
Publication date: 24 February 2005
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Circle packings and discrete conformal geometry (52C26)
Related Items (23)
A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching ⋮ The minimum convex container of two convex polytopes under translations ⋮ Quasi-phi-functions and optimal packing of ellipses ⋮ EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE ⋮ Evolutionary computation solutions to the circle packing problem ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Packing disks into disks with optimal worst-case density ⋮ Bundling three convex polygons to minimize area or perimeter ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Adaptive beam search lookahead algorithms for the circular packing problem ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Packing equal circles into a circle with circular prohibited areas ⋮ A dynamic sampling approach towards computing Voronoi diagram of a set of circles ⋮ AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ Unnamed Item ⋮ Near optimal minimal convex hulls of disks ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
Cites Work
- Unnamed Item
- Unnamed Item
- Some progress in the packing of equal circles in a square
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A better packing of ten equal circles in a square
- Packing up to 50 equal circles in a square
- Curved hexagonal packings of equal disks in a circle
- Dense packings of congruent circles in a circle
- Geometric properties of random disk packings.
- Packing of 18 equal circles on a sphere
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Generalization of Voronoi Diagrams in the Plane
- Dense Packing of Equal Circles within a Circle
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- The Packing of Equal Circles in a Square
- Packing Cylinders into Cylindrical Containers
- Packing of 14, 16, 17 and 20 Circles in a Circle
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
This page was built for publication: Disk packing for the estimation of the size of a wire bundle
