Before revision:  In this paper, we show the existence of a polynomial time algorithm for solving maximum clique in a geometric superclass of unit disk graphs.
After revision:  In this paper, we show the existence of a polynomial time algorithm for a geometric superclass of unit disk graphs.