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:20250110T023309Z
LOCATION:Hall B5 (1)\, B Block\, Level 5
DTSTART;TZID=Asia/Tokyo:20241203T132300
DTEND;TZID=Asia/Tokyo:20241203T133400
UID:siggraphasia_SIGGRAPH Asia 2024_sess103_papers_402@linklings.com
SUMMARY:Stripe Embedding: Efficient Maps with Exact Numeric Computation
DESCRIPTION:Technical Papers\n\nMarco Livesu (CNR IMATI)\n\nWe consider th
 e fundamental problem of injectively mapping a surface mesh with disk topo
 logy onto a boundary constrained convex domain. We start from the basic ob
 servation that mapping a strip of triangles onto a rectangular shape alway
 s yields a valid embedding if the vertices that bound the strip are sorted
  coherently along the sides of the rectangle. Based on this intuition we p
 ropose a straightforward algorithm, called Stripe Embedding, that operates
  by decomposing the input mesh into a set of triangle strips and then embe
 ds each strip into the target domain by means of linear interpolation betw
 een two previously embedded vertices. Thanks to its simplicity, Stripe Emb
 edding is extremely efficient and permits to switch to an exact implementa
 tion without almost increasing its running times. Stripe Embedding is up t
 o three orders of magnitude faster than the Tutte embedding for same numer
 ical model and, even when implemented with costly rational numbers, it is 
 faster than any floating point implementation of prior methods at any scal
 e.\n\nRegistration Category: Full Access, Full Access Supporter\n\nLanguag
 e Format: English Language\n\nSession Chair: Baoquan Chen (Peking Universi
 ty)
URL:https://asia.siggraph.org/2024/program/?id=papers_402&sess=sess103
END:VEVENT
END:VCALENDAR