Near optimal minimal convex hulls of disks
From MaRDI portal
Publication:2046265
DOI10.1007/s10898-021-01002-5zbMath1473.90129OpenAlexW3139170258MaRDI QIDQ2046265
Chanyoung Song, Josef Kallrath, Deok-Soo Kim, Joonghyun Ryu, Mokwon Lee
Publication date: 17 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01002-5
global optimizationVoronoi diagramconvex hullsnon-convex nonlinear programmingpolylithicQuickhullDiskVOROPACK-D
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-phi-functions and optimal packing of ellipses
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Robust mixed-integer linear programming models for the irregular strip packing problem
- A sweepline algorithm for Euclidean Voronoi diagram of circles
- Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- Polylithic modeling and solution approaches using algebraic modeling systems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Note on an inequality of Wegner
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A convex hull algorithm for discs, and applications
- On the computational geometry of pocket machining
- Polygon offsetting using a Voronoi diagram and two stacks.
- Minimal surface convex hulls of spheres
- Disk packing for the estimation of the size of a wire bundle
- Representing the Voronoï diagram of a simple polygon using rational quadratic Bézier curves
- Packing ellipsoids in an optimized cylinder
- Mathematical model and efficient algorithms for object packing problem
- QuickhullDisk: a faster convex hull algorithm for disks
- Constraints in container loading -- a state-of-the-art review
- The geometry of nesting problems: a tutorial
- Packing circles into perimeter-minimizing convex hulls
- A dynamic adaptive local search algorithm for the circular packing problem
- Voronoi Diagrams and Delaunay Triangulations
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Generalization of Voronoi Diagrams in the Plane
- The isoperimetric inequality
- Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
- EUCLIDEAN VORONOI DIAGRAM FOR 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: Near optimal minimal convex hulls of disks
