reconstructing generalized staircase polygons with uniform ... · reconstructing generalized...
TRANSCRIPT
![Page 1: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/1.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Department of Computer ScienceColgate University
Reconstructing Generalized StaircasePolygons with Uniform Step LengthNodari Sitchinava and Darren Strash
u
v
u
v
u sees v
GD 2017 | Sept. 25, 2017
![Page 2: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/2.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Visibility graphs
Given a polygon P, we construct its visibility graph GPas follows:• vertex v in GP ↔ v is a vertex on P ’s boundary.• edge (u, v)↔ u sees v .
PGP
(uv does not intersect exterior of P)
1
![Page 3: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/3.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Visibility graphs
Given a polygon P, we construct its visibility graph GPas follows:• vertex v in GP ↔ v is a vertex on P ’s boundary.• edge (u, v)↔ u sees v .
PGP
(uv does not intersect exterior of P)
7 intersects exterior
See alongboundary edges
See through collinear vertices
1
![Page 4: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/4.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Visibility graphs
Given a polygon P, we construct its visibility graph GPas follows:• vertex v in GP ↔ v is a vertex on P ’s boundary.• edge (u, v)↔ u sees v .
PGP
(uv does not intersect exterior of P)
1
![Page 5: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/5.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Visibility graphs
Given a polygon P, we construct its visibility graph GPas follows:
Can be computed in O(n log n + m) time [Ghosh & Mount, 1991]
• vertex v in GP ↔ v is a vertex on P ’s boundary.• edge (u, v)↔ u sees v .
PGP
(uv does not intersect exterior of P)
1
![Page 6: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/6.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Recognition and reconstructionWhat about the reverse?
Input: A graph G:
→ ∃P?
→ P
• Reconstruction Problem: Give a polygon P, which has Ghas its visibility graph.
• Recognition Problem: Is G the visibility graph of somepolygon?
2
![Page 7: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/7.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Quick: Known Results
• Recognition is in PSPACE. [Everett, 1994]• Reconstruction complexity is open• Special cases: limited visibility due to reflex chains
convex
towerspiral
A single clique
[Choi et al., 1995] [Everett & Corneil, 1995]
simplex vertices
3
![Page 8: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/8.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Quick: Known Results
• Recognition is in PSPACE. [Everett, 1994]• Reconstruction complexity is open• Special cases: limited visibility due to reflex chains• Orthogonal polygons?
Alternative visibility definitions Reconstruction Recognition
[Abello et al., 1995][Abello & Egecioglu, 1993]
3
![Page 9: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/9.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Uniform-Step Length Polygons
The only reconstruction result is for staircase polygons withuniform length [Abello & Egecioglu, 1993]
All “steps” have same length
4
![Page 10: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/10.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Uniform-Step Length Polygons
The only reconstruction result is for staircase polygons withuniform length [Abello & Egecioglu, 1993]
All “steps” have same length
Can we efficiently reconstruct polygons with more staircases?
?
4
![Page 11: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/11.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Our Results
unit-length orthogonally convex
7
7
77 7
same edge lengths no dentsedges change direction
Uniform-length orthogonally convex polygons can bereconstructed O(n2m) time. (n vertices, m edges.)
5
![Page 12: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/12.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Our Results
uniform-length histogram
7
7
one long base edge edges change direction
Histogram reconstruction is fixed parameter tractable on thenumber of tabs k , with time O(n2m + (k − 2)!2k−2(n log n + m)).
k tabs
6
![Page 13: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/13.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
simplicial vertices• Staircase polygons have simplicial vertices
Simplicial vertices and edges
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
7
![Page 14: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/14.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
• No simplicial vertices?→ we need new techniques
simplicial vertices
none are simplicial
• Staircase polygons have simplicial vertices
Simplicial vertices and edges
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
7
![Page 15: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/15.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
• No simplicial vertices?→ we need new techniques
simplicial vertices
none are simplicial
• Staircase polygons have simplicial vertices
Simplicial vertices and edges
• Idea: Evaluate edges in only one maximal clique
e→ 1-simplicial edges
→ identify convex-convex boundary edges
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
7
![Page 16: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/16.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
1-simplicial edges
Most expensive operation is testing each edge for membership inexactly 1 maximal clique.
8
![Page 17: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/17.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
1-simplicial edges
Most expensive operation is testing each edge for membership inexactly 1 maximal clique.
→ for (u, v), find common neighborhood O(n) time
2 Steps:
u v
N(u) ∩N(v)
8
![Page 18: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/18.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
1-simplicial edges
Most expensive operation is testing each edge for membership inexactly 1 maximal clique.
For all m edges, this takes O(n2m) total time.
→ for (u, v), find common neighborhood O(n) time
2 Steps:
→ Test if N(u) ∩N(v) is a clique in O(n2) time
u v
N(u) ∩N(v)
8
![Page 19: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/19.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 0: Determine convex and reflex vertices.
9
![Page 20: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/20.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 0: Determine convex and reflex vertices.
9
![Page 21: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/21.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 1: Find tab edges
Step 0: Determine convex and reflex vertices.
9
![Page 22: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/22.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 1: Find tab edges
Step 2: Choose one to be the topmost
Step 0: Determine convex and reflex vertices.topmost
9
![Page 23: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/23.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 1: Find tab edges
Step 2: Choose one to be the topmost
Step 0: Determine convex and reflex vertices.
Step 3: Determine vertices on “short” staircases.
topmost
9
![Page 24: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/24.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 1: Find tab edges
Step 2: Choose one to be the topmost
Step 0: Determine convex and reflex vertices.
Step 3: Determine vertices on “short” staircases.
Step 4: Assign remaining vertices to “long” staircases
topmost
9
![Page 25: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/25.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex case: the algorithm
Step 1: Find tab edges
Step 2: Choose one to be the topmost
Step 0: Determine convex and reflex vertices.
Step 3: Determine vertices on “short” staircases.
Step 4: Assign remaining vertices to “long” staircases
topmost
Step 5: Orient & construct the boundary
9
![Page 26: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/26.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 27: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/27.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 28: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/28.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 29: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/29.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Structural lemma:
Every convex vertex u has a convexneighbor v , such that (u, v) is in onemaximal clique.
Edges incident to a reflex vertex are intwo or more maximal cliques
and
u
v
u
v
uv
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 30: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/30.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Structural lemma:
Every convex vertex u has a convexneighbor v , such that (u, v) is in onemaximal clique.
Edges incident to a reflex vertex are intwo or more maximal cliques
and
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 31: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/31.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Convex/Reflex Vertices
Compute all convex vertices by computing all edges contained inexactly one maximal clique.
Structural lemma:
Every convex vertex u has a convexneighbor v , such that (u, v) is in onemaximal clique.
Edges incident to a reflex vertex are intwo or more maximal cliques
and
Now Simple:
Maximal clique in GP ↔ maximal convex subpolygon on vertices of P.
10
![Page 32: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/32.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
C0C1
C2C3
C4
Elementary clique:
Elementary cliques can be ordered,starting from a tab.
A maximal clique containing 3 convexvertices∗.
Initial staircase reconstruction
11
![Page 33: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/33.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
C0C1
C2C3
C4
Elementary clique:
Elementary cliques can be ordered,starting from a tab.
A maximal clique containing 3 convexvertices∗.
Initial staircase reconstruction
Ci shares 3 reflex vertices with Ci−1
→ Orders the clique vertices along some staircase.
11
![Page 34: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/34.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
12
![Page 35: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/35.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
12
![Page 36: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/36.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
12
![Page 37: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/37.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
12
![Page 38: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/38.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
12
![Page 39: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/39.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
12
![Page 40: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/40.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Filling in remaining staircases
But some vertices remainafter looking at allelementary cliques.
We know some vertices...
Construct via “rectangular” maximalcliques from known convex verticesto unknown convex vertices.
Gives us all remaining vertices
12
![Page 41: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/41.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
13
![Page 42: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/42.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
13
![Page 43: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/43.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
Step 2: Remove and repeat
13
![Page 44: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/44.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
Step 2: Remove and repeat
13
![Page 45: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/45.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
Step 2: Remove and repeat
Step 3: Construct a contract tree of all rectangles
13
![Page 46: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/46.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
Step 2: Remove and repeat
Step 3: Construct a contract tree of all rectangles
Step 4: Order the tree to construct the polygon
? ?
13
![Page 47: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/47.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: high-level algorithm
Step 1: Determine tabs
Step 2: Remove and repeat
Step 3: Construct a contract tree of all rectangles
Step 4: Order the tree to construct the polygon
? ?
→ generate polygon and check visibility graph
3
13
![Page 48: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/48.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
An ordering of the leaves gives us an ordering of the tree
k leaves
14
![Page 49: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/49.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
An ordering of the leaves gives us an ordering of the tree
k leaves
→ and maps vertices to coordinates
14
![Page 50: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/50.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
An ordering of the leaves gives us an ordering of the tree
k leaves
Each ordering gives a polygon
→ and maps vertices to coordinates
14
![Page 51: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/51.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
An ordering of the leaves gives us an ordering of the tree
k leaves
Each ordering gives a polygon
Compute its visibility graph and check for a match inO(n log n + m) time.
3
→ and maps vertices to coordinates
14
![Page 52: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/52.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
An ordering of the leaves gives us an ordering of the tree
k leaves
Each ordering gives a polygon
Compute its visibility graph and check for a match inO(n log n + m) time.
3
Seems like O(k !(n log n + m)) time...
→ and maps vertices to coordinates
14
![Page 53: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/53.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
But we also need to orient the tabs from left to right.
→ 2k possible orientations of leaves
15
![Page 54: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/54.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
But we also need to orient the tabs from left to right.
→ 2k possible orientations of leaves
+ time to compute 1-simplicial edges
→ O(n2m + k !2k(n log n + m)) time.
15
![Page 55: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/55.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
But we also need to orient the tabs from left to right.
→ 2k possible orientations of leaves
+ time to compute 1-simplicial edges
→ O(n2m + k !2k(n log n + m)) time.
Can fix the outer two paths, leaving us with only (k − 2)!2k−2 options
→ O(n2m + (k − 2)!2k−2(n log n + m)) time.
15
![Page 56: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/56.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Histograms: Running time
But we also need to orient the tabs from left to right.
→ 2k possible orientations of leaves
+ time to compute 1-simplicial edges
→ O(n2m + k !2k(n log n + m)) time.
Can fix the outer two paths, leaving us with only (k − 2)!2k−2 options
→ O(n2m + (k − 2)!2k−2(n log n + m)) time.
→ O(n2m) time for binary trees (recursively fix right/left spine)
15
![Page 57: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/57.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Conclusion
Since we assign vertices to coordinates, we get recognition for free.
→ compute coordinates and check visibility graph
16
![Page 58: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/58.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Conclusion
• What about orthogonal polygons with fewer restrictions?• Is it possible to reconstruct orthogonal convex fans in
polynomial time?• Are there more general classes of polygons that can be
recognized / reconstructed?
General problem is still open...
Since we assign vertices to coordinates, we get recognition for free.
→ compute coordinates and check visibility graph
16
![Page 59: Reconstructing Generalized Staircase Polygons with Uniform ... · Reconstructing Generalized Staircase Polygons with Uniform Step Length Department of Computer Science Colgate University](https://reader034.vdocuments.us/reader034/viewer/2022042612/5f652c90f6bd705659303cc4/html5/thumbnails/59.jpg)
Nodari Sitchinava and Darren Strash:Reconstructing Generalized Staircase Polygons with Uniform Step Length
Department of Computer ScienceColgate University
Conclusion
• What about orthogonal polygons with fewer restrictions?• Is it possible to reconstruct orthogonal convex fans in
polynomial time?• Are there more general classes of polygons that can be
recognized / reconstructed?
Thank You!
General problem is still open...
Since we assign vertices to coordinates, we get recognition for free.
→ compute coordinates and check visibility graph
16