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:20260114T163633Z
LOCATION:Darling Harbour Theatre\, Level 2 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231212T093000
DTEND;TZID=Australia/Melbourne:20231212T124500
UID:siggraphasia_SIGGRAPH Asia 2023_sess209_papers_128@linklings.com
SUMMARY:Analysis and Synthesis of Digital Dyadic Sequences
DESCRIPTION:Abdalla Ahmed (King Abdullah University of Science and Technol
 ogy (KAUST)) and Mikhail Skopenkov, Markus Hadwiger, and Peter Wonka (KAUS
 T)\n\nWe explore the space of matrix-generated $(0, m, 2)$-nets and $(0, 2
 )$-sequences in base 2, also known as digital dyadic nets and sequences.\n
 In computer graphics, they are arguably leading the competition for use in
  rendering.\nWe provide a complete characterization of the design space an
 d count the possible number of constructions with and without considering 
 possible reorderings of the point set. \nBased on this analysis, we then s
 how that every digital dyadic net can be reordered into a sequence, togeth
 er with a corresponding algorithm.\nFinally, we present a novel family of 
 self-similar digital dyadic sequences, to be named $\xi$-sequences, that s
 pans a subspace with fewer degrees of freedom.\nThose $\xi$-sequences are 
 extremely efficient to sample and compute, and we demonstrate their advant
 ages over the classic Sobol $(0, 2)$-sequence.\n\nRegistration Category: F
 ull Access, Enhanced Access, Trade Exhibitor, Experience Hall Exhibitor\n\
 n
URL:https://asia.siggraph.org/2023/full-program?id=papers_128&sess=sess209
END:VEVENT
END:VCALENDAR