Towards an Evolved Lower Bound for the Most Circular Partition of a - - PowerPoint PPT Presentation

towards an evolved lower bound for the most circular
SMART_READER_LITE
LIVE PREVIEW

Towards an Evolved Lower Bound for the Most Circular Partition of a - - PowerPoint PPT Presentation

Towards an Evolved Lower Bound for the Most Circular Partition of a Square Claudia Obermaier Markus Wagner {obermaie,wagnermar}@uni-koblenz.de Circular Polygons Circular Polygons d scc Aspect ratio diameter(smallest circumscribing circle)


slide-1
SLIDE 1

Towards an Evolved Lower Bound for the Most Circular Partition

  • f a Square

Claudia Obermaier Markus Wagner {obermaie,wagnermar}@uni-koblenz.de

slide-2
SLIDE 2

Circular Polygons

slide-3
SLIDE 3

Circular Polygons

Aspect ratio γ

diameter(smallest circumscribing circle)

=

dscc

slide-4
SLIDE 4

Circular Polygons

Aspect ratio γ

diameter(smallest circumscribing circle) diameter(larges inscribed circle)

=

dlid dscc

Square: γ = 1.414

slide-5
SLIDE 5

Circular Polygons

Aspect ratio γ

diameter(smallest circumscribing circle) diameter(larges inscribed circle)

=

Square: γ = 1.414 Pentagon: γ = 1.236 Hexagon: γ = 1.155

slide-6
SLIDE 6

Circular Polygons

Aspect ratio γ

Square: γ = 1.414 Pentagon: γ = 1.236 Hexagon: γ = 1.155

Near 1.0  circular

slide-7
SLIDE 7

Circular Partitions

slide-8
SLIDE 8

Circular Partitions

Partition of a polygon P in P1, …, Pn

P1 P2 P3 P4

slide-9
SLIDE 9

Circular Partitions

Partition of a polygon P in P1, …, Pn γpartition = max { γ(P1), …, γ(Pn) }

slide-10
SLIDE 10

Circular Partition into Convex Polygons

Best so far [DIO03] γ = 1.29950

[DIO03] Mirela Damian-Iordache and Joseph O’Rourke. Partitioning regular polygons into circular pieces I: Convex partitions. CoRR, cs.CG/0304023, 2003.

slide-11
SLIDE 11

Circular Partition into Convex Polygons

Best so far [DIO03] γ = 1.29950 Lower bound γ = 1.28868 Our question: Is some improvement possible?

slide-12
SLIDE 12

Evolutionary Algorithm

  • 1. Representation
  • 2. Fitness Function
  • 3. Selection Mechanism
  • 4. Initial Population
slide-13
SLIDE 13

Operators

  • Push Operator

mutates vertices

  • Tile Operator

Tile Operator

mutates non-circular polygons mutates non-circular polygons

  • Star Operator

mutates concave polygons

  • Crossover Operator
slide-14
SLIDE 14

Tile Operator

slide-15
SLIDE 15

Tile Operator

Tetragon! Square: γ = 1.414 Pentagon: γ = 1.236 Hexagon: γ = 1.155

slide-16
SLIDE 16

Tile Operator

slide-17
SLIDE 17

Tile Operator

Tetragon gone!

slide-18
SLIDE 18

Short Run Results

γ = 1.6699 γ = 1.3405

  • ptimal: γ = 1.3396

Long way to γ = 1.2995

slide-19
SLIDE 19

Discussion

Long run experiments: No improvement

  • ver [DIO03] (γ = 1.29950)
  • Seeding crucial
  • Not trivial to leave local minima
  • Search space
  • High level of epistasis

γ = 1.28898

slide-20
SLIDE 20

Thank you!

slide-21
SLIDE 21

Thank you!

Personal Note I’m looking for a PhD position 