### Abstract

This paper discussed the problem of rinding intersections between surfaces. Surfaces are divided into planar sub-patches, typically triangles. Triangles of one surface are tested for intersection with triangles of the second surface, one by one. The triangles are first projected on a horizontal plane and a vertical plane. The well-known cutting plane method of descriptive geometry is modified and applied to evaluate the line-segment of intersection between two planar triangles. The set of line-segments thus obtained approximate the curve of intersection between the two surfaces.

Original language | English (US) |
---|---|

Pages (from-to) | 399-412 |

Number of pages | 14 |

Journal | Computers and Industrial Engineering |

Volume | 34 |

Issue number | 2-4 |

DOIs | |

State | Published - Apr 1 1998 |

### ASJC Scopus subject areas

- Computer Science(all)
- Engineering(all)

## Fingerprint Dive into the research topics of 'Implementation of a polygonal algorithm for surface-surface intersections'. Together they form a unique fingerprint.

## Cite this

Roy, U., & Dasari, V. R. (1998). Implementation of a polygonal algorithm for surface-surface intersections.

*Computers and Industrial Engineering*,*34*(2-4), 399-412. https://doi.org/10.1016/s0360-8352(97)00276-3