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:20240214T070245Z
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:Technical Papers\n\nJieyin Yang and Xiaohong Jia (Key Laborato
 ry of Mathematics Mechanization, Chinese Academy Of Sciences; University o
 f Chinese Academy of Sciences) and Dong-Ming Yan (National Laboratory of P
 attern Recognition, Institute of Automation, Chinese Academy of Sciences)\
 n\nThe surface/surface intersection technique serves as one of the most fu
 ndamental functions in modern CAD systems. Despite the long research histo
 ry and successful applications of surface intersection algorithms in vario
 us CAD industrial software, challenges still exist in balancing the comput
 ational efficiency, accuracy as well as the topology correctness. Specific
 ally, most practical intersection algorithms fail to guarantee the correct
  topology of the intersection curve(s) when two surfaces are under near-cr
 itical or other complicated relative positions, which brings instability t
 o CAD systems. Even for the most successfully used commercial geometry eng
 ines ACIS that serves as the current industrial standard, some complicated
  intersection topology can still be a tough nut to crack. \n\nIn this pape
 r, we present a practical topology-guaranteed algorithm for computing the 
 intersection of two B-spline surfaces. Our algorithm can treat the hard in
 tersection topology situations with practical efficiency, including cross 
 intersections, contacts in one or more isolated points, intersections alon
 g boundaries, contacts in different intersection branches, as well as high
  order contacts along a curve. We present representative examples of these
  hard topology situations that challenge the open-source geometry engine O
 CCT and the commercial engine ACIS, but find a way out in our algorithm. W
 e also compare our algorithms in both efficiency and topology correctness 
 on plenty of normal models with the open-source package SISL as well as OC
 CT and ACIS.\n\nRegistration Category: Full Access\n\nSession Chair: Oded 
 Stein (University of Southern California, MIT)
URL:https://asia.siggraph.org/2023/full-program?id=papers_390&sess=sess144
END:VEVENT
END:VCALENDAR