On the Number of Views of Polyhedral Terrains.
M. Sharir, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
Displaying similar documents to “On the Complexity of Polyhedral Separability.”
On the Number of Views of Polyhedral Terrains.
Computability and Complexity of Ray Tracing.
J.H. Reif, J.D. Tygar, A. Yoshida (1994)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
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:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
Mathematical snapshots from the computational geometry landscape.
Matoušek, Jiří (1998)
Documenta Mathematica
Similarity: