Disk packing for the estimation of the size of a wire bundle
type: Item
instance of: scholarly article
title: Disk packing for the estimation of the size of a wire bundle
zbMATH Open document ID: 1126.52300
DOI: 10.1007/BF03167582
author: Masayoshi Sawai
author: Hiroaki Sano
author: D.-S. Kim
author: D. Kim
author: K. Sugihara
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2005-02-24T00:00:00Z
review text: A heuristic method for packing disks in a circle is constructed, and is applied to the estimation of the sizes of holes through which given sets of electric wires are to pass. In the proposed method, a sufficiently large circle is initially constructed, and it is shrunk step by step while keeping all the disks inside. For this purpose a Voronoi diagram for circles is used. Computational experiments show the validity and the efficiency of the method.
Mathematics Subject Classification ID: 52C22
Mathematics Subject Classification ID: 52C26
zbMATH DE Number: 2138389
zbMATH Keywords: circle packing
zbMATH Keywords: circle Voronoi diagram
zbMATH Keywords: wire bundling
zbMATH Keywords: bundle size
zbMATH Keywords: automobile industry
MaRDI profile type: Publication
cites work: Q4219187
cites work: Solving the Continuous p-Dispersion Problem Using Non-linear Programming
cites work: Packing of 18 equal circles on a sphere
cites work: The Packing of Equal Circles in a Square
cites work: Packing of 14, 16, 17 and 20 Circles in a Circle
cites work: Dense packings of congruent circles in a circle
cites work: Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
cites work: Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
cites work: Packing Cylinders into Cylindrical Containers
cites work: Generalization of Voronoi Diagrams in the Plane
cites work: Curved hexagonal packings of equal disks in a circle
cites work: Geometric properties of random disk packings.
cites work: Some progress in the packing of equal circles in a square
cites work: Packing up to 50 equal circles in a square
cites work: Q4361347
cites work: Dense Packing of Equal Circles within a Circle
cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs
cites work: A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
cites work: A better packing of ten equal circles in a square
cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
Recommended article: Calculs de dimensions de packing
Recommended article: Q3756076
Recommended article: Packing disks into disks with optimal worst-case density
Recommended article: Q5088965
Recommended article: A method for finding the densest lattice k-fold packing of disks
Recommended article: Q3218722
Recommended article: Packing disks on a torus
Recommended article: A constraint on the random packing of disks
Recommended article: Packing dimension estimation for exceptional parameters
description: scientific article; zbMATH DE number 2138389