Data Structures for Restricted Triangular Range Searching

We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear space and achieve polylogarithmic query times.

• Type: Conference
• Year: 2008
• Where: CCCG
• Authors: Mashhood Ishaque, Diane L. Souvaine, Nadia Benbernou
• Keywords: CCCG 2008, Computational Geometry, Data Structures, Query Triangle, Triangular Emptiness