Abstract.We address the problems of counting and analyzing empty pseudo-triangles defined by a set of points in the plane. First, we assume that the three convex vertices are fixed, and provide algorithms, which solve the counting problem in quadratic time using linear space, for the cases when the pseudo-triangles can be arbitrary or must be star-shaped.In addition, we demonstrate that our approach leads to a fairly simple method for retrieving empty pseudo-triangles optimal in a certain sense in cubic time and linear space. The relaxation of our assumption increases the time complexity by factor n 3 in each case.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.