VOROPACK-D: real-time disk packing algorithm using Voronoi diagram
From MaRDI portal
Cites work
- A beam search algorithm for the circular packing problem
- A better packing of ten equal circles in a square
- A circle packing algorithm
- A dynamic adaptive local search algorithm for the circular packing problem
- A linearized circle packing algorithm
- A literature review on circle and sphere packing problems: models and methodologies
- A nonlinear programming model with implicit variables for packing ellipsoids
- A polynomial time circle packing algorithm
- A short note on a simple search heuristic for the diskspacking problem
- A sweepline algorithm for Euclidean Voronoi diagram of circles
- Adaptive and restarting techniques-based algorithms for circular packing problems
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Apollonian circle packings and closed horospheres on hyperbolic 3-manifolds. With appendix by Hee Oh and Nimish Shah
- Apollonian circle packings: Number theory
- Curved hexagonal packings of equal disks in a circle
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Dense packing of congruent circles in free-form non-convex containers
- Dense Packing of Equal Circles within a Circle
- Dense packings of congruent circles in a circle
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Densest packings of eleven congruent circles in a circle
- Disk packing for the estimation of the size of a wire bundle
- Disks vs. spheres: Contrasting properties of random packings
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
- Generalization of Voronoi Diagrams in the Plane
- Geometric properties of random disk packings.
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- High density packings of equal circles in rectangles with variable aspect ratio
- How to simulate billiards and similar systems
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 62659 (Why is no real title available?)
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- Integrated container loading software for pulp and paper industry
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- New approaches to circle packing in a square. With program codes.
- New results in the packing of equal circles in a square
- On the Densest Packing of Circles
- On the Densest Packing of Spheres in a Cube
- Optimal packing and covering in the plane are NP-complete
- Optimising the palletisation of cylinders in cases
- Packing circles into perimeter-minimizing convex hulls
- Packing Cylinders into Cylindrical Containers
- Packing different-sized circles into a rectangular container
- Packing ellipsoids into volume-minimizing rectangular boxes
- Packing equal circles into a circle with circular prohibited areas
- Packing of 14, 16, 17 and 20 Circles in a Circle
- Packing problems
- Packing unequal circles using formulation space search
- Packing up to 50 equal circles in a square
- PERM for solving circle packing problem
- Polygon offsetting using a Voronoi diagram and two stacks.
- Quasi-phi-functions and optimal packing of ellipses
- Recursive sequences in the Ford sphere packing
- Reformulation descent applied to circle packing problems
- Repeated patterns of dense packings of equal disks in a square
- Representing the Voronoï diagram of a simple polygon using rational quadratic Bézier curves
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- Some progress in the packing of equal circles in a square
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The Densest Packing of 9 Circles in a Square
- The Packing of Equal Circles in a Square
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- Two personification strategies for solving circles packing problem
- 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
- Voronoi diagrams and Delaunay triangulations
- Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene.
- Über einen geometrischen Satz.
This page was built for publication: VOROPACK-D: real-time disk packing algorithm using Voronoi diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262440)
