The Shadows of a Cycle Cannot All Be Paths

July 09, 2015 Β· Declared Dead Β· πŸ› Canadian Conference on Computational Geometry

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Prosenjit Bose, Jean-Lou De Carufel, Michael G. Dobbins, Heuna Kim, Giovanni Viglietta arXiv ID 1507.02355 Category cs.CG: Computational Geometry Cross-listed cs.CV, math.MG Citations 1 Venue Canadian Conference on Computational Geometry Last Checked 3 months ago
Abstract
A "shadow" of a subset $S$ of Euclidean space is an orthogonal projection of $S$ into one of the coordinate hyperplanes. In this paper we show that it is not possible for all three shadows of a cycle (i.e., a simple closed curve) in $\mathbb R^3$ to be paths (i.e., simple open curves). We also show two contrasting results: the three shadows of a path in $\mathbb R^3$ can all be cycles (although not all convex) and, for every $d\geq 1$, there exists a $d$-sphere embedded in $\mathbb R^{d+2}$ whose $d+2$ shadows have no holes (i.e., they deformation-retract onto a point).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Computational Geometry

R.I.P. πŸ‘» Ghosted

Dynamic Planar Convex Hull

Riko Jacob, Gerth StΓΈlting Brodal

cs.CG πŸ› The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. πŸ“š 240 cites 7 years ago

Died the same way β€” πŸ‘» Ghosted