BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2026//talk//33JU7Y
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon-2026-33JU7Y@pretalx.com
DTSTART;TZID=CET:20260812T113000
DTEND;TZID=CET:20260812T114500
DESCRIPTION:The SpatialTreeInterface defined in GeometryOps.jl provides an 
 efficient way for geometrical queries of polygons that share a crs by rely
 ing on search trees whose branches are characterized by rectangular boundi
 ng boxes. However\, when working across different projections\, for exampl
 e when trying to identify intersecting polygons from different projections
  on the sphere\, rectangles in one projection do not translate into rectan
 gles in another projection\, so the tree traversal will not be accurate. \
 n\nTo solve this problem\, we extended the SpatialTreeInterface in Spheric
 alSpatialTrees.jl by replacing rectangular bounding boxes with SphericalCa
 ps\, using these to characterize the extent of all branches in a spatial t
 ree. This enables users to do combined tree searches across polygons based
  on different projections\, as is common e.g. in Discrete Global Grid Syst
 em. The presentation will demonstrate the basic concept of the SphericalSp
 atialTrees.jl package as well as a few downstream applications. \n\nI orde
 r to solve the problem of
DTSTAMP:20260710T092546Z
LOCATION:Muschel — N3
SUMMARY:Fast geospatial lookups across projections using SphericalSpatialTr
 ees.jl - Fabian Gans
URL:https://pretalx.com/juliacon-2026/talk/33JU7Y/
END:VEVENT
END:VCALENDAR