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:Room 325-AB\, Level 3\, West Wing
DTSTART;TZID=Asia/Seoul:20221206T140000
DTEND;TZID=Asia/Seoul:20221206T153000
UID:siggraphasia_SIGGRAPH Asia 2022_sess156_papers_233@linklings.com
SUMMARY:SurfaceVoronoi: Efficiently Computing Voronoi Diagrams Over Mesh S
 urfaces with Arbitrary Distance Solvers
DESCRIPTION:Technical Communications, Technical Papers, TOG\n\nSurfaceVoro
 noi: Efficiently Computing Voronoi Diagrams Over Mesh Surfaces with Arbitr
 ary Distance Solvers\n\nXin, Wang, Xu, Yan, Chen...\n\nIn this paper, we p
 ropose to compute Voronoi diagrams over mesh surfaces driven by an arbitra
 ry geodesic distance solver, assuming that the input is a triangle mesh as
  well as a collection of sites mathbf{P}={p_i}_{i=1}^m on the surface. We 
 propose two key techniques to solve this problem. First, as the partition 
 is determined by minimizing the m distance fields, each of which rooted at
  a source site, we suggest keeping one or more distance triples, for each 
 triangle, that may help determine the Voronoi bisectors when one uses a ma
 rk-and-sweep geodesic algorithm to predict the multi-source distance field
 . Second, rather than keep the distance itself at a mesh vertex, we use th
 e squared distance to characterize the linear change of distance field res
 tricted in a triangle, which is proved to induce an exact VD when the base
  surface reduces to a planar triangle mesh. Specially, our algorithm also 
 supports the Euclidean distance, which can handle thin-sheet models(e.g. l
 eaf) and runs faster than the traditional restricted Voronoi diagram (RVD)
  algorithm. It is very extensible to deal with various variants of surface
 -based Voronoi diagrams including (1) surface-based power diagram, (2) con
 strained Voronoi diagram with curve-type breaklines, and (3) curve-type ge
 nerators. We conduct extensive experimental results to validate the abilit
 y to approximate the exact VD in different distance-driven scenarios.\n\nR
 egistration Category: FULL ACCESS, ON-DEMAND ACCESS\n\nLanguage: ENGLISH\n
 \nFormat: IN-PERSON, ON-DEMAND
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_233&sess=sess15
 6
END:VEVENT
END:VCALENDAR