BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Seoul
X-LIC-LOCATION:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:18871231T000000
DTSTART:19881009T020000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230103T035307Z
LOCATION:Auditorium\, Level 5\, West Wing
DTSTART;TZID=Asia/Seoul:20221206T100000
DTEND;TZID=Asia/Seoul:20221206T120000
UID:siggraphasia_SIGGRAPH Asia 2022_sess153_papers_193@linklings.com
SUMMARY:Hierarchical Layout Blending with Recursive Optimal Correspondence
DESCRIPTION:Technical Papers\n\nHierarchical Layout Blending with Recursiv
 e Optimal Correspondence\n\nXu, Li, Yang, Shi, Fu...\n\nWe present a novel
  method for blending hierarchical layouts with semantic labels. The core o
 f our method is a hierarchical structure correspondence algorithm, which r
 ecursively finds optimal substructure correspondences, achieving a globall
 y optimal correspondence between a pair of hierarchical layouts. This corr
 espondence is consistent with the structures of both layouts, allowing us 
 to define the union of the layouts' structures. The resulting compound str
 ucture helps extract intermediate layout structures, from which blended la
 youts can be generated via an optimization approach. The correspondence al
 so defines a similarity measure between layouts in a hierarchically struct
 ured view. Our method provides a new way for novel layout creation. The in
 troduced structural similarity measure regularizes the layouts in a hypers
 pace. We demonstrate two applications in this paper, i.e., exploratory des
 ign of novel layouts and sketch-based layout retrieval, and test them on a
  magazine layout dataset. The effectiveness and feasibility of these two a
 pplications are confirmed by the user feedback and the extensive results. 
 The code is available at https://github.com/lyf7115/LayoutBlending.\n\nReg
 istration Category: FULL ACCESS, EXPERIENCE PLUS ACCESS, EXPERIENCE ACCESS
 , TRADE EXHIBITOR\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_193&sess=sess15
 3
END:VEVENT
END:VCALENDAR