visibility graphs of staircase polygonsreu.dimacs.rutgers.edu/~yulia/final presentation.pdf · let...

VisibilityGraphsofStaircasePolygons

Yulia AlexandrMentor:Prof.JamesAbelloNSF grant CCF-1559855

Letmeremindyou…• Weconsiderasimplenon-degeneratecollectionofpointsintheplanethatproducesapolygon• Inparticular,welookatstaircasepolygonpaths• Twoverticesofapolygonarecalledinternallyvisibleiftheclosedlinesegmentbetweenthemiseitheranedgeofthepolygonorliesentirelyintheinteriorofthepolygon(Abello etal)• Thevisibilitygraphofapolygonisagraphwhosevertexsetisthesameasthevertexsetofthepolygonandwhoseedgesarethestraight-linesegmentsbetweeninternallyvisiblevertices

v0

v2u2

v3u3

v4u4

v5

v1 u1

BalancedTableau

1

2

3

4

8

7

9 10

6 5

• Hookofacell isthecollectionofcellsthatincludesthechosencellwithallthecellsaboveitandallthecellstotheright

• Mate cellswithrespecttothechosencell• Atableauisbalanced ifthevalueofeverycellliesinbetweeneverypairofmatecellsinitshook

• (!)Tableaurepresentssloperanks inastaircasepathonnvertices

2

3

4

5

3

4

5

2

1

1

1

1

1

1

0

1 1

0 1

1

2

3

4

8

7

9 10

6 5 1

LocalMax(Min)Rule

• Applytheruletoobtaintheadjacencymatrix

ProblemStatement

• TheproblemisknowntobePSPACE• WealsowanttoknowwhetheritisNPorP

?

?

ProblemStatement:Input: AbalancedtableauTnOutput: Buildastaircasepolygons.t. itsvisibilitygraphisisomorphictolocalmax (Tn)

WhatItried:

• RandomStuff L

• ConvexHullApproach L

• InductiveApproach L /J• VisibilityRegionsApproach 😍

VisibilityRegionsApproach

• Startsbuildingfromthemiddle• Takesadvantageofunboundedness• Formsavisibilityregiontoplaceeachnewvertex

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example1

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example1

3

2

4

1

1

1

1

1

0

1 1

0 11

2

3

4

5 5

4

3

2

1

Example1

5

• Canvisibilityregionsbeempty?

Toogoodtobetrue…

• Canvisibilityregionsbeempty?Yep.

Toogoodtobetrue…

• Canvisibilityregionsbeempty?Yep.• Why?

Toogoodtobetrue…

• Canvisibilityregionsbeempty?Yep.• Why? Researchishard.

Toogoodtobetrue…

• Canvisibilityregionsbeempty?Yep.• Why? Researchishard.• Whatmakesthemempty?

Toogoodtobetrue…

• Canvisibilityregionsbeempty?Yep.• Why? Researchishard.• Whatmakesthemempty? Notpreservingsloperanksoffarthestseenvertices!!

Toogoodtobetrue…

3

2

4

1

5

1

1

1

1

1

0

1 1

0 11

1

2

3

4

8

7

9 10

6 5

1

2

3

4

5

2

3

4

5

12

3

4

9 10

5

8

• Regionsareneveremptyaslongaswepreservesloperanksoffarthestseenverticesateachstageofconstruction

• Concave-concave(convex-convex)• Concave-convex(convex-concave)• Generalcase

WhatIproved:

• Regionsareneveremptyaslongaswepreservesloperanksoffarthestseenverticesateachstageofconstruction

• Concave-concave(convex-convex)• Concave-convex(convex-concave)• Generalcase

• Itisalwayspossibletopreservesloperanksoffarthestseenvertices

WhatIproved:

• Determinecomplexity• Doublecheckandpolishproofs• Finalizeresultsforpublication

What’sleft:

Acknowledgements:

• Prof.JamesAbello• DIMACSandProf.Gallos• NSF grant CCF-1559855

Thanks!J

•References:• [1]Abello etal, VisibilityGraphsofStaircasePolygonsandtheWeakBruhatOrder,I:fromVisibilityGraphstoMaximalChains*.Discrete&ComputationalGeometry.1995.331-358.