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:Auditorium\, Level 5\, West Wing
DTSTART;TZID=Asia/Seoul:20221206T100000
DTEND;TZID=Asia/Seoul:20221206T120000
UID:siggraphasia_SIGGRAPH Asia 2022_sess153_papers_233@linklings.com
SUMMARY:SurfaceVoronoi: Efficiently Computing Voronoi Diagrams Over Mesh S
 urfaces with Arbitrary Distance Solvers
DESCRIPTION:Technical Papers\n\nSurfaceVoronoi: Efficiently Computing Voro
 noi Diagrams Over Mesh Surfaces with Arbitrary Distance Solvers\n\nXin, Wa
 ng, Xu, Yan, Chen...\n\nIn this paper, we propose to compute Voronoi diagr
 ams over mesh surfaces driven by an arbitrary geodesic distance solver, as
 suming 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 s
 olve this problem. First, as the partition is determined by minimizing the
  m distance fields, each of which rooted at a source site, we suggest keep
 ing one or more distance triples, for each triangle, that may help determi
 ne the Voronoi bisectors when one uses a mark-and-sweep geodesic algorithm
  to predict the multi-source distance field. Second, rather than keep the 
 distance itself at a mesh vertex, we use the squared distance to character
 ize the linear change of distance field restricted in a triangle, which is
  proved to induce an exact VD when the base surface reduces to a planar tr
 iangle mesh. Specially, our algorithm also supports the Euclidean distance
 , which can handle thin-sheet models(e.g. leaf) and runs faster than the t
 raditional restricted Voronoi diagram (RVD) algorithm. It is very extensib
 le to deal with various variants of surface-based Voronoi diagrams includi
 ng (1) surface-based power diagram, (2) constrained Voronoi diagram with c
 urve-type breaklines, and (3) curve-type generators. We conduct extensive 
 experimental results to validate the ability to approximate the exact VD i
 n different distance-driven scenarios.\n\nRegistration Category: FULL ACCE
 SS, EXPERIENCE PLUS ACCESS, EXPERIENCE ACCESS, TRADE EXHIBITOR\n\nLanguage
 : ENGLISH\n\nFormat: IN-PERSON
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_233&sess=sess15
 3
END:VEVENT
END:VCALENDAR