On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Computability and Complexity of Ray Tracing.”
On the Complexity of Polyhedral Separability.
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:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
On Range Searching with Semialgebraic Sets.
J. Matousek, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
On the Number of Views of Polyhedral Terrains.
M. Sharir, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
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: