### Abstract

We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equations; using these zero-sets we characterize developable surface patches and planar patches that belong to the boundary of the convex hull.

Original language | English |
---|---|

Pages (from-to) | 171-183 |

Number of pages | 13 |

Journal | Computing (Vienna/New York) |

Volume | 72 |

Issue number | 1-2 |

Publication status | Published - 2004 Jun 7 |

Externally published | Yes |

### Keywords

- B-spline
- Common tangent
- Convex hull
- Freeform rational surface
- Symbolic computation
- Zero-set finding

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'The convex hull of freeform surfaces'. Together they form a unique fingerprint.

## Cite this

Seong, J. K., Elber, G., Johnstone, J. K., & Kim, M. S. (2004). The convex hull of freeform surfaces.

*Computing (Vienna/New York)*,*72*(1-2), 171-183.