## About: Circle packing in a squareGotoSponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)

Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square aiming to get the greatest minimal separation, dn, between points. To convert between these two formulations of the problem, the square side for unit circles will be . Solutions (not necessarily optimal) have been computed for every N≤10,000. Solutions up to N=20 are shown below:

AttributesValues
rdfs:label
• Circle packing in a square
rdfs:comment
• Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square aiming to get the greatest minimal separation, dn, between points. To convert between these two formulations of the problem, the square side for unit circles will be . Solutions (not necessarily optimal) have been computed for every N≤10,000. Solutions up to N=20 are shown below:
foaf:depiction
foaf:isPrimaryTopicOf
thumbnail
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
• Circle packing in a square is a packing problem in applied mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square aiming to get the greatest minimal separation, dn, between points. To convert between these two formulations of the problem, the square side for unit circles will be . Solutions (not necessarily optimal) have been computed for every N≤10,000. Solutions up to N=20 are shown below: The obvious square packing is optimal for 1, 4, 9, 16, 25, and 36 circles (the smallest six square numbers), but ceases to be optimal for larger squares from 49 onwards.
prov:wasDerivedFrom
page length (characters) of wiki page
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git51 as of Sep 16 2020

Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About

OpenLink Virtuoso version 08.03.3319 as of Dec 29 2020, on Linux (x86_64-centos_6-linux-glibc2.12), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2021 OpenLink Software