10 Aug Talk: Planar Support For Hypergraphs

[Siddhartha Jain]

Dear All,

Please find the details of Friday's T-Talk.

Speaker: Ambar Pal

Abstract:

Given a hypergraph $H=(X,S)$, a support is a graph $G=(X,E)$, on the vertex set $X$, such that $X\cap S_i$ induces a connected subgraph for each $S_i \in S}$. Further, if $G$ is planar, then it is called a planar support. 

In this talk, we will look at geometric hypergraphs. Here the hyperedges are convex non-piercing regions in a plane and the vertices are points on the plane. We will analyse the case where the regions are rectangles and show how to construct a planar support in time $O(n polylog(n))$ for this case.

The proof uses a nice construction using L-shaped Delaunay edges, and should be easily accessible without any prerequisites. If time permits we will also look at some analogues of the properties of Delaunay Triangulations in this world.

Venue: A007 

Time: 1 pm - 2 pm, 10 August 2018

[Siddhartha Jain]

Please note that for tomorrow the venue has been changed to C03.

--
You received this message because you are subscribed to the Google Groups "Theory" group.
To unsubscribe from this group and stop receiving emails from it, send an email to theory+un...@iiitd.ac.in.
To post to this group, send email to the...@iiitd.ac.in.
Visit this group at https://groups.google.com/a/iiitd.ac.in/group/theory/.

[Siddhartha Jain]

Dear all,

Please note that considering the seminar from 1:30-2:30 today, the talk has been postponed to Tuesday 1-2pm just for this week. Sorry for the inconvenience.

Venue for Tuesday will be confirmed later.

[Siddhartha Jain]

The venue for tomorrow is A007. See you there!

[Ambar Pal]

Dear All,

There would be a delay, we will start at 1:30 today. Apologies for the inconvenience caused.

Regards

Ambar

[Évariste Club]

We're starting in 5 mins.