| Kim, M.-S., "Motion Planning with Geometric Models," Ph.D Thesis, Dept. Computer Science, Purdue University, Dec. 1988. 43 |
....interior points and surface patches is non trivial since their intersections may have complex topological structures in space. For 2D objects A and B, it is possible to detect and eliminate these redundancies by using a plane sweep algorithm similar to the one discussed in this paper, also see [20, 26, 32]. Using this method, we can approximate the convolution A B within arbitrary precision (though limited by the machine precision) simply by generating and adding dense boundary points of A and B. There is no difficulty in determining the correct global topology of convolution boundary. An ....
Kim, M.-S., "Motion Planning with Geometric Models," Ph.D Thesis, Dept. Computer Science, Purdue University, Dec. 1988. 43
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC