Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
440980 | Computer-Aided Design | 2008 | 10 Pages |
Abstract
We present several algorithms for self-intersection detection, and possible elimination, in freeform planar curves and surfaces. Both local and global self-intersections are eliminated using a binormal-line criterion and a simple direct algebraic elimination procedure that enables the direct solution of the algebraic (self-)intersection constraints.All algorithms have been fully implemented and tested. Examples are presented for applications in self-intersection detection, self-intersection-free metamorphosis of curves, and proper trimming of self-intersections in offset curves.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Diana Pekerman, Gershon Elber, Myung-Soo Kim,