A plane set admits an inscribed rectangle if every homeomorphic copy of it in contains the 4 vertices of at least one Euclidean rectangle. Vaughan proved that admits an inscribed rectangle by reducing the problem to the non-embeddability of the projective plane in (it is not known if admits an inscribed rectangle of aspect ratio 1:1 i.e. a square). In this talk, using the non-embeddability of the Cone() and the Cone() in we classify plane compact connected locally-connected sets that admit inscribed rectangles. Using similar topological techniques, we also present a one-dimensional non-connected set such that every copy of it in admits an inscribed rectangle with at least one vertex in each component.