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:20260417T190105Z
LOCATION:West Building\, Rooms 220-222
DTSTART;TZID=America/Los_Angeles:20250814T090000
DTEND;TZID=America/Los_Angeles:20250814T103000
UID:siggraph_SIGGRAPH 2025_sess134@linklings.com
SUMMARY:Lightning Fast Geometry
DESCRIPTION:Lighting Fast Geometry - Interactive Discussion\n\nAfter the s
 ummary presentations, attendees will participate in an interactive discuss
 ion. Outside the room will be a series of poster boards for authors to gat
 her around with the audience. Authors are invited to bring any material re
 lated to their paper that could instigate further conversation such...\n\n
 ---------------------\nDynamic Mesh Processing on the GPU\n\nIntroducing t
 he first GPU-based system for dynamic triangle mesh processing, delivering
  order-of-magnitude speedups over CPU solutions across diverse application
 s. Our system uses patch-based data structure, speculative conflict handli
 ng, and a novel programming model, enabling robust, high-performa...\n\n\n
 Ahmed H. Mahmoud (Computer Science and Artificial Intelligence Laboratory 
 (CSAIL), Massachusetts Institute of Technology (MIT)) and Serban D. Porumb
 escu and John D. Owens (University of California, Davis)\n----------------
 -----\nSphere Carving: Bounding Volumes for Signed Distance Fields\n\nWe i
 ntroduce Sphere Carving, a method for automatically computing bounding vol
 umes for conservative implicit surface. SDF queries define a set of sphere
 s, from which we extract intersection points, used to compute a bounding v
 olume with guarantees. Sphere Carving is conceptually simple and independe
 ...\n\n\nHugo Schott (INSA, Lyon; Adobe); Théo Thonat and Thibaud Lambert 
 (Adobe); Eric Guérin (INSA, Lyon); Eric Galin (Université Claude Bernard L
 yon 1); and Axel Paris (Adobe)\n---------------------\nIn Search of Empty 
 Spheres: 3D Apollonius Diagrams on GPU\n\nWe introduce a novel constructio
 n algorithm of 3D Apollonius diagrams designed for GPUs. Our method featur
 es a fast execution while allowing a comprehensive computation. This is ma
 de possible thanks to a light data structure, a cell update procedure and 
 a spacial exploration strategy all designed to...\n\n\nCyprien Plateau--Ho
 lleville (Université de Limoges, XLIM); Benjamin Stamm (Universität Stuttg
 art, Institute of Applied Analysis and Numerical Simulation); Vincent Nivo
 liers (Université Claude Bernard Lyon 1, LIRIS); and Maxime Maria and Stép
 hane Mérillou (Université de Limoges, XLIM)\n---------------------\nStocha
 stic Barnes-Hut Approximation for Fast Summation on the GPU\n\nWe present 
 a novel stochastic version of the Barnes-Hut approximation. Regarding the 
 level-of-detail (LOD) family of approximations as control variates, we con
 struct an unbiased estimator of the kernel sum being approximated. Through
  several examples in graphics, we demonstrate that our method outpe...\n\n
 \nAbhishek Madan (University of Toronto); Nicholas Sharp, Francis Williams
 , and Ken Museth (NVIDIA); and David I.W. Levin (University of Toronto, NV
 IDIA)\n---------------------\nUltraMeshRenderer: Efficient Structure and M
 anagement of GPU Out-of-core Memory for Real-time Rendering of Gigantic 3D
  Meshes\n\nThis paper presents UltraMeshRenderer, a GPU out-of-core method
  for real-time rendering of 3D scenes with billions of vertices and triang
 les. It features a balanced hierarchical mesh, coherence-based LOD selecti
 on, and parallel in-place GPU memory management, achieving efficient data 
 transfer and me...\n\n\nHuadong Zhang (Rochester Institute of Technology);
  Lizhou Cao (Rochester Institute of Technology, University of Maryland Eas
 tern Shore); and Chao Peng (Rochester Institute of Technology)\n----------
 -----------\nFast Determination and Computation of Self-intersections for 
 NURBS Surfaces\n\nDetecting surface self-intersections is crucial for CAD 
 modeling to prevent issues in simulation and manufacturing. This paper pre
 sents an algebraic signature-based algorithm for fast determining self-int
 ersections of NURBS surfaces. This signature is then recursively cross-use
 d to compute the self-...\n\n\nKai Li and Xiaohong Jia (State Key Laborato
 ry of Mathematical Sciences, Academy of Mathematics and Systems Science, C
 hinese Academy of Sciences; University of Chinese Academy of Sciences); Fa
 lai Chen (University of Science and Technology of China); and Kai Li\n\nIn
 terest Area: Research & Education\n\nRecording: Livestreamed, Not Livestre
 amed, Recorded, Not Recorded\n\nRegistration Category: Full Conference, Vi
 rtual Access, Thursday\n\nSession Chair: Edward Chien (Boston University)
END:VEVENT
END:VCALENDAR