Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Geometric Inequality and the Complexity of Computing Volume.”
Computing the Volume is Difficult.
The Complexity of Cutting Complexes.
B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (1989)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
Computability and Complexity of Ray Tracing.
J.H. Reif, J.D. Tygar, A. Yoshida (1994)
Discrete & computational geometry
Similarity:
On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry
Similarity:
Towards applying computational complexity to foundations of physics.
Kreinovich, V., Finkelstein, A.M. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Several methods of the reduction of computational complexity.
Sharashidze, G. (2004)
Bulletin of TICMI
Similarity:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri, C. Monma (1992)
Discrete & computational geometry
Similarity:
Some Provably Hard Crossing Number Problems.
D. Bienstock (1991)
Discrete & computational geometry
Similarity:
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
K. Kedem, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
A. Mukhopadhyay, S. Jadhav (1994)
Discrete & computational geometry
Similarity: