BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260114T163712Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231213T144000
DTEND;TZID=Australia/Melbourne:20231213T145500
UID:siggraphasia_SIGGRAPH Asia 2023_sess144_papers_390@linklings.com
SUMMARY:Topology Guaranteed B-Spline Surface/Surface Intersection
DESCRIPTION:Jieyin Yang and Xiaohong Jia (Key Laboratory of Mathematics Me
 chanization, Chinese Academy Of Sciences; University of Chinese Academy of
  Sciences) and Dong-Ming Yan (National Laboratory of Pattern Recognition, 
 Institute of Automation, Chinese Academy of Sciences)\n\nThe surface/surfa
 ce intersection technique serves as one of the most fundamental functions 
 in modern CAD systems. Despite the long research history and successful ap
 plications of surface intersection algorithms in various CAD industrial so
 ftware, challenges still exist in balancing the computational efficiency, 
 accuracy as well as the topology correctness. Specifically, most practical
  intersection algorithms fail to guarantee the correct topology of the int
 ersection curve(s) when two surfaces are under near-critical or other comp
 licated relative positions, which brings instability to CAD systems. Even 
 for the most successfully used commercial geometry engines ACIS that serve
 s as the current industrial standard, some complicated intersection topolo
 gy can still be a tough nut to crack. \n\nIn this paper, we present a prac
 tical topology-guaranteed algorithm for computing the intersection of two 
 B-spline surfaces. Our algorithm can treat the hard intersection topology 
 situations with practical efficiency, including cross intersections, conta
 cts in one or more isolated points, intersections along boundaries, contac
 ts in different intersection branches, as well as high order contacts alon
 g a curve. We present representative examples of these hard topology situa
 tions that challenge the open-source geometry engine OCCT and the commerci
 al engine ACIS, but find a way out in our algorithm. We also compare our a
 lgorithms in both efficiency and topology correctness on plenty of normal 
 models with the open-source package SISL as well as OCCT and ACIS.\n\nRegi
 stration Category: Full Access\n\nSession Chair: Oded Stein (Technion, Uni
 versity of Southern California)\n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_390&sess=sess144
END:VEVENT
END:VCALENDAR