In this paper we outline a technique for constructing directed strongly regular graphs by using strongly regular graphs having a "nice" family of intriguing sets. Further, we investigate such a construction method for rank three strongly regular graphs having at most 45 vertices. Finally, several examples of intriguing sets of polar spaces are provided
