AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
From MaRDI portal
Publication:4650086
DOI10.1142/S0218195911003858zbMath1251.68278MaRDI QIDQ4650086
Takuro Fukunaga, Hiroshi Nagamochi, Hirofumi Aota
Publication date: 23 November 2012
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45)
Cites Work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Optimal packing and covering in the plane are NP-complete
- Covering a rectangle with equal circles
- Dense packings of congruent circles in a circle
- Disk packing for the estimation of the size of a wire bundle
- Approximation algorithms for lawn mowing and milling
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Covering a rectangle with six and seven circles
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- A threshold of ln n for approximating set cover
- Dense Packing of Equal Circles within a Circle
- Packing Cylinders into Cylindrical Containers
- Approximation of geometric dispersion problems
