BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20230206T120000Z
UID:0a43eeb68066e7fff3ed4d18fdfc1fcf-404
DTSTAMP:19700101T120014Z
DESCRIPTION:Exploring the Size of Order-k Voronoi Tessellation and Chromatic Delaunay Mosaic
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/404/exploring-the-size-of-order-k-voronoi-tessellation-and-chromatic-delaunay-mosaic/
SUMMARY:In this presentation, we will first delve into the topic of the size of order-k Voronoi tessellations. Specifically, we will examine how Lee's inductive argument for counting cells in R^2 can be generalized to R^3, resulting in precise relations involving Morse-theoretic quantities for piecewise constant functions on planar arrangements. Additionally, we will introduce the concept of a chromatic Delaunay mosaic, which is a Delaunay mosaic in R^(s+d) that illustrates the intermixing of points of (s+1) colors within a locally finite set of points in R^d. Our primary findings include bounds on the size of this chromatic Delaunay mosaic. These results are the product of a collaborative effort with Sebastiano Cultrera, Herbert Edelsbrunner, Ondrej Draganov, and Morteza Saghafian.
<br>
<br>
This is an online Seminar. The Teams URL for this is: <br>
<a href="https://tinyurl.com/RanitaBiswasTalk">https://tinyurl.com/RanitaBiswasTalk</a>
DTSTART:20230206T120000Z
END:VEVENT
END:VCALENDAR