### Abstract

An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.

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

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | Publ by IEEE |

Pages | 29-38 |

Number of pages | 10 |

ISBN (Print) | 0818624450 |

State | Published - Dec 1 1991 |

Event | Proceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA Duration: Oct 1 1991 → Oct 4 1991 |

### Publication series

Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
---|---|

ISSN (Print) | 0272-5428 |

### Other

Other | Proceedings of the 32nd Annual Symposium on Foundations of Computer Science |
---|---|

City | San Juan, PR, USA |

Period | 10/1/91 → 10/4/91 |

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'An optimal convex hull algorithm and new results on cuttings'. Together they form a unique fingerprint.

## Cite this

Chazelle, B. (1991). An optimal convex hull algorithm and new results on cuttings. In

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 29-38). (Annual Symposium on Foundations of Computer Science (Proceedings)). Publ by IEEE.