BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240214T070245Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231213T155500
DTEND;TZID=Australia/Melbourne:20231213T161000
UID:siggraphasia_SIGGRAPH Asia 2023_sess145_papers_128@linklings.com
SUMMARY:Analysis and Synthesis of Digital Dyadic Sequences
DESCRIPTION:Technical Papers\n\nAbdalla Ahmed (King Abdullah University of
  Science and Technology (KAUST)) and Mikhail Skopenkov, Markus Hadwiger, a
 nd Peter Wonka (KAUST)\n\nWe explore the space of matrix-generated $(0, m,
  2)$-nets and $(0, 2)$-sequences in base 2, also known as digital dyadic n
 ets and sequences.\nIn computer graphics, they are arguably leading the co
 mpetition for use in rendering.\nWe provide a complete characterization of
  the design space and count the possible number of constructions with and 
 without considering possible reorderings of the point set. \nBased on this
  analysis, we then show that every digital dyadic net can be reordered int
 o a sequence, together with a corresponding algorithm.\nFinally, we presen
 t a novel family of self-similar digital dyadic sequences, to be named $\x
 i$-sequences, that spans a subspace with fewer degrees of freedom.\nThose 
 $\xi$-sequences are extremely efficient to sample and compute, and we demo
 nstrate their advantages over the classic Sobol $(0, 2)$-sequence.\n\nRegi
 stration Category: Full Access\n\nSession Chair: Young J. Kim (Ewha Womans
  University)
URL:https://asia.siggraph.org/2023/full-program?id=papers_128&sess=sess145
END:VEVENT
END:VCALENDAR