"Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, ..."

Alkan Atak et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2024.83

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/AtakBHHH0P24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/AtakBHHH0P24
Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, Patrick Pawelczyk:
Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge). SoCG 2024: 83:1-83:9

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.