## An optimal algorithm for intersecting three-dimensional convex polyhedra (1992)

by
Bernard Chazelle

Venue: | SIAM J. Comput |

Citations: | 62 - 4 self |

### BibTeX

@ARTICLE{Chazelle92anoptimal,

author = {Bernard Chazelle},

title = {An optimal algorithm for intersecting three-dimensional convex polyhedra},

journal = {SIAM J. Comput},

year = {1992},

volume = {21},

pages = {586--591}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given. Key words, computational geometry, convex polyhedra AMS(MOS) subject classifications. 68Q25, 68H05 1. Introduction. Giventwo