Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
Displaying similar documents to “The Complexity of Cutting Complexes.”
Computing the Volume is Difficult.
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
Halving point sets.
Andrzejak, Artur, Welzl, Emo (1998)
Documenta Mathematica
Similarity:
Nonoverlap of the Star Unfolding.
H. Edelsbrunner (1992)
Discrete & computational geometry
Similarity:
Mathematical snapshots from the computational geometry landscape.
Matoušek, Jiří (1998)
Documenta Mathematica
Similarity:
On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry
Similarity:
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
D. Kirkpatrick, B. Mishra, Chee-Keng Yap (1992)
Discrete & computational geometry
Similarity:
Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
Computability and Complexity of Ray Tracing.
J.H. Reif, J.D. Tygar, A. Yoshida (1994)
Discrete & computational geometry
Similarity:
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity: