BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260805T205517Z
LOCATION:Room 403  B
DTSTART;TZID=America/Los_Angeles:20260720T140000
DTEND;TZID=America/Los_Angeles:20260720T153000
UID:siggraph_SIGGRAPH 2026_sess120@linklings.com
SUMMARY:Speedy 3D
DESCRIPTION:gCDT:  A Highly Parallel GPU Algorithm for Large-Scale Constra
 ined Delaunay Triangulation\n\nWe present a highly parallel GPU algorithm 
 for 2D constrained Delaunay triangulation that robustly handles arbitrary 
 valid constraints. It computes triangulations of up to 10 million vertices
  in 0.1 seconds on an RTX 4090, substantially outperforming prior GPU meth
 ods and widely used CPU implementat...\n\n\nPeng Fan (Zhejiang University)
 ; Min Tang (Zhejiang University, Zhejiang Sci-Tech University); Ruofeng To
 ng (Zhejiang University); Lili He (Zhejiang Sci-Tech University); Peng Du 
 (Zhejiang University); and Hailong Li (Shenzhen Poisson Software Co., Ltd.
 )\n---------------------\nScalable GPU Construction of 3D Voronoi and Powe
 r Diagrams\n\nWe present a GPU algorithm for constructing large-scale 3D V
 oronoi and power diagrams. By combining directional geometric culling with
  hierarchical best-first traversal, our method efficiently handles tens of
  millions of points across diverse spatial distributions. Applied to mesh-
 based neural rende...\n\n\nBernardo Taveira and Carl Lindström (Chalmers U
 niversity of Technology, Zenseact); Maryam Fatemi (Zenseact); and Lars Ham
 marstrand and Fredrik Kahl (Chalmers University of Technology)\n----------
 -----------\nGPU-accelerated Certified Hausdorff Distance Between Triangle
  Meshes\n\nWe present a GPU-accelerated certified algorithm for the direct
 ed Hausdorff distance between triangle meshes. By replacing recursive bran
 ch-and-bound with a parallel wavefront pipeline, it delivers millisecond-s
 cale, tolerance-controlled results on models with millions of triangles, e
 nabling interac...\n\n\nHaopeng Fan (Zhejiang University); Min Tang (Zheji
 ang University, Zhejiang Sci-Tech University); Leonardo Sacht (Universidad
 e Federal de Santa Catarina); Qiang Zou (State Key Lab of CAD and CG, Zhej
 iang University); and Ruofeng Tong and Peng Du (Zhejiang University)\n----
 -----------------\nPQ-Free HD: Priority-Queue-Free Hausdorff Distance for 
 Triangle Meshes on GPU\n\nWe present a method for computing error-bounded 
 Hausdorff distance between triangle meshes on the GPU. By eliminating the 
 serial bottleneck in traditional branch-and-bound algorithms, our approach
  achieves high-throughput performance and enables geometry processing appl
 ications that require guarante...\n\n\nZhihao Hu and Renjie Chen (Universi
 ty of Science and Technology of China)\n---------------------\nManifold k-
 NN: Accelerated k-NN Queries for Manifold Point Clouds\n\nWe present Manif
 old k-NN, a dynamic programming-based framework for accelerated k-nearest 
 neighbor search on manifold point clouds. By recursively partitioning inse
 rtion history via Voronoi successor lists, our method achieves 1–10× speed
 up over kd-trees in volume-to-surface queries, while sup...\n\n\nPengfei W
 ang, Qinghao Guo, Haisen Zhao, and Shiqing Xin (Shandong University); Shua
 ngmin Chen (Qingdao University of Science and Technology); Changhe Tu (Sha
 ndong University); and Wenping Wang (Texas A&M University)\n--------------
 -------\nLocality-Aware Automatic Differentiation on the GPU for Mesh-Base
 d Computations\n\nWe present a GPU system for automatic differentiation fo
 r functions defined on triangle meshes that exploits locality and sparsity
  to deliver efficient derivative computation. From simple user-defined ene
 rgy terms, the system produces gradients, Jacobians, and sparse Hessians, 
 accelerating simulatio...\n\n\nAhmed Mahmoud, Rahul Goel, Jonathan Ragan-K
 elley, and Justin Solomon (Massachusetts Institute of Technology (MIT))\n-
 --------------------\nSpeedy 3D - Interactive Discussion\n\nAfter the summ
 ary presentations, attendees will participate in an interactive discussion
 . Outside the room will be a series of poster boards for authors to gather
  around with the audience. Authors are invited to bring any material relat
 ed to their paper that could instigate further conversation such...\n\n\nI
 nterest Area: Research & Education\n\nKeyword: Geometry, Hardware, Modelin
 g, Rendering\n\nRegistration Category: Full Conference Supporter, Full Con
 ference\n\nSession Chair: Tamy Boubekeur (Adobe)
END:VEVENT
END:VCALENDAR