Results

**1 - 4**of**4**### CONSTRUCTING THE VISIBILITY COMPLEX OF POLYTOPES IN 3-SPACE

"... Abstract. We prove the connexity of the boundary of each 4-dimensional cell of the 3D visibility complex of disjoint convex polyhedra. Using this property, we outline a simple algorithm for the construction of the visibility complex of k disjoint, convex polyhedra in time O(n 2 k 2 log n) where n is ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. We prove the connexity of the boundary of each 4-dimensional cell of the 3D visibility complex of disjoint convex polyhedra. Using this property, we outline a simple algorithm for the construction of the visibility complex of k disjoint, convex polyhedra in time O(n 2 k 2 log n) where n is the total complexity of the polyhedra. 1.

### unknown title

"... We show how to compute the bitangents of two ellipses, and how to evaluate the predicates required to compute objects like convex hulls or visibility complexes for ellipses. Also, we show how to compute the tangency points of the bitangents. ..."

Abstract
- Add to MetaCart

(Show Context)
We show how to compute the bitangents of two ellipses, and how to evaluate the predicates required to compute objects like convex hulls or visibility complexes for ellipses. Also, we show how to compute the tangency points of the bitangents.