Turán- and Szemerédi-type theorems prove the existence of certain well-behaved patterns in dense graphs and hypergraphs. Here we show much stronger/larger patterns exist for graphs and hypergraphs that arise from geometry or algebra. The talk is based on recent joint works with Jacob Fox, János Pach, Adam Sheffer, and Josh Zahl.