An acyclicity theorem for cell complexes in d dimension

H. Edelsbrunner, in:, ACM, 1989, pp. 145–151.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Abstract
Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.
Publishing Year
Date Published
1989-06-01
Page
145 - 151
Conference
SCG: Symposium on Computational Geometry
IST-REx-ID

Cite this

Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In: ACM; 1989:145-151. doi:10.1145/73833.73850
Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension (pp. 145–151). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/73833.73850
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension,” 145–51. ACM, 1989. https://doi.org/10.1145/73833.73850.
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” presented at the SCG: Symposium on Computational Geometry, 1989, pp. 145–151.
Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. SCG: Symposium on Computational Geometry 145–151.
Edelsbrunner, Herbert. An Acyclicity Theorem for Cell Complexes in d Dimension. ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar