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:20241203T135800
DTEND;TZID=Asia/Tokyo:20241203T140900
UID:siggraphasia_SIGGRAPH Asia 2024_sess103_papers_1184@linklings.com
SUMMARY:A Progressive Embedding Approach to Bijective Tetrahedral Maps dri
 ven by Cluster Mesh Topology
DESCRIPTION:Technical Papers\n\nValentin Zenon Nigolian (University of Ber
 n), Marcel Campen (Osnabrück University), and David Bommes (University of 
 Bern)\n\nWe present a novel algorithm to map ball-topology tetrahedral mes
 hes onto star-shaped domains with guarantees regarding bijectivity. Our al
 gorithm is based on the recently introduced idea of Shrink-and-Expand, whe
 re images of interior vertices are initially clustered at one point (Shrin
 k-), before being sequentially moved to non-degenerate positions yielding 
 a bijective map (-and-Expand). In this context, we introduce the concept o
 f the cluster mesh, i.e. the unexpanded interior mesh consisting of geomet
 rically degenerate simplices.\nUsing local, per-vertex connectivity inform
 ation solely from the cluster mesh, we show that a viable expansion sequen
 ce guaranteed to produce a bijective map can always be found as long as th
 e mesh is shellable.\nIn addition to robustness guarantees for this ubiqui
 tous class of inputs, other practically relevant benefits include improved
  parsimony and reduced algorithmic complexity.\nWhile inheriting some of t
 he worst-case high run time requirements of the state of the art, signific
 ant acceleration for the average case is experimentally demonstrated.\n\nR
 egistration Category: Full Access, Full Access Supporter\n\nLanguage Forma
 t: English Language\n\nSession Chair: Baoquan Chen (Peking University)
URL:https://asia.siggraph.org/2024/program/?id=papers_1184&sess=sess103
END:VEVENT
END:VCALENDAR
