On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Computing Simple Circuits from a Set of Line Segments.”
On Lines Missing Polyhedral Sets in 3-Space.
Repeated Angles in E4 .
G. Purdy (1988)
Discrete & computational geometry
Similarity:
Polyhedral Line Transversals in Space.
D. Avis, Rephael Wenger (1988)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
A Sylvester Theorem for Conic Sections.
J.A. Wiseman, Paul R. Wilson (1988)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
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: