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:20230103T035312Z
LOCATION:Room 325-AB\, Level 3\, West Wing
DTSTART;TZID=Asia/Seoul:20221208T170000
DTEND;TZID=Asia/Seoul:20221208T183000
UID:siggraphasia_SIGGRAPH Asia 2022_sess171_papers_193@linklings.com
SUMMARY:Hierarchical Layout Blending with Recursive Optimal Correspondence
DESCRIPTION:Technical Communications, Technical Papers\n\nHierarchical Lay
 out Blending with Recursive Optimal Correspondence\n\nXu, Li, Yang, Shi, F
 u...\n\nWe present a novel method for blending hierarchical layouts with s
 emantic labels. The core of our method is a hierarchical structure corresp
 ondence algorithm, which recursively finds optimal substructure correspond
 ences, achieving a globally optimal correspondence between a pair of hiera
 rchical layouts. This correspondence is consistent with the structures of 
 both layouts, allowing us to define the union of the layouts' structures. 
 The resulting compound structure helps extract intermediate layout structu
 res, from which blended layouts can be generated via an optimization appro
 ach. The correspondence also defines a similarity measure between layouts 
 in a hierarchically structured view. Our method provides a new way for nov
 el layout creation. The introduced structural similarity measure regulariz
 es the layouts in a hyperspace. We demonstrate two applications in this pa
 per, i.e., exploratory design of novel layouts and sketch-based layout ret
 rieval, and test them on a magazine layout dataset. The effectiveness and 
 feasibility of these two applications are confirmed by the user feedback a
 nd the extensive results. The code is available at https://github.com/lyf7
 115/LayoutBlending.\n\nRegistration Category: FULL ACCESS, ON-DEMAND ACCES
 S\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON, ON-DEMAND
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_193&sess=sess17
 1
END:VEVENT
END:VCALENDAR