BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Tokyo
X-LIC-LOCATION:Asia/Tokyo
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:JST
DTSTART:18871231T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260817T171515Z
LOCATION:Hall C\, C Block\, Level 4
DTSTART;TZID=Asia/Tokyo:20241203T090000
DTEND;TZID=Asia/Tokyo:20241203T120000
UID:siggraphasia_SIGGRAPH Asia 2024_sess223_papers_402@linklings.com
SUMMARY:Stripe Embedding: Efficient Maps with Exact Numeric Computation
DESCRIPTION:Marco Livesu (CNR IMATI)\n\nWe consider the fundamental proble
 m of injectively mapping a surface mesh with disk topology onto a boundary
  constrained convex domain. We start from the basic observation that mappi
 ng a strip of triangles onto a rectangular shape always yields a valid emb
 edding if the vertices that bound the strip are sorted coherently along th
 e sides of the rectangle. Based on this intuition we propose a straightfor
 ward algorithm, called Stripe Embedding, that operates by decomposing the 
 input mesh into a set of triangle strips and then embeds each strip into t
 he target domain by means of linear interpolation between two previously e
 mbedded vertices. Thanks to its simplicity, Stripe Embedding is extremely 
 efficient and permits to switch to an exact implementation without almost 
 increasing its running times. Stripe Embedding is up to three orders of ma
 gnitude faster than the Tutte embedding for same numerical model and, even
  when implemented with costly rational numbers, it is faster than any floa
 ting point implementation of prior methods at any scale.\n\nRegistration C
 ategory: Enhanced Access, Full Access, Full Access Supporter\n\nLanguage F
 ormat: English Language\n\n
URL:https://asia.siggraph.org/2024/program/?id=papers_402&sess=sess103
END:VEVENT
END:VCALENDAR