Abstract
A subset X of the d-dimensional Euclidean space ℝd can cover its shadows in Rd, if every orthogonal projection of X onto a (d-1)-dimensional linear subspace of ℝd is contained in some congruent copy of X. Whereas every two-dimensional convex disc C ⊂Rd has this property, no (d-1)-polytope does, provided that d>-4. © 1986 Springer-Verlag New York Inc.
Cite
CITATION STYLE
APA
Debrunner, H. E., & Mani-Levitska, P. (1986). Can you cover your shadows? Discrete & Computational Geometry, 1(1), 45–58. https://doi.org/10.1007/BF02187682
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free