To main content

Algorithms for Finding the Topology of Complex Surface Self Intersections

Abstract

Self-intersecting surfaces may be the result of several standard CAD operations. Often such surfaces are searched for the existence of self-intersections, but no attempt is made to actually compute the selfintersections. This talk will focus on the topology of self-intersection curves, and methods for computing it. A recursive approach for solving intersection problems is applied. Some examples of industrial type self-intersecting surfaces will serve as a starting point for the discussion.

Category

Academic lecture

Language

English

Author(s)

Affiliation

  • SINTEF Digital / Mathematics and Cybernetics

Presented at

Tenth SIAM Conference on Geometric Design & Computing

Place

The Historic Menger Hotel, San Antonio, Texas

Date

04.11.2007 - 08.11.2007

Organizer

Society for Industrial and Äpplied Mathematics

Year

2007

View this publication at Cristin