Data Structures for Restricted Triangular Range Searching

13 years 6 months ago

Download www.eecs.tufts.edu

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.

Mashhood Ishaque, Diane L. Souvaine, Nadia Benbern

Real-time Traffic

CCCG 2008 | Computational Geometry | Data Structures | Query Triangle | Triangular Emptiness |

claim paper

» Segment intersection searching problems in general settings

» Geometric BurrowsWheeler Transform Linking Range Searching and Text Indexing

» Towards a dynamic data structure for efficient bounded line range search

» A dynamic data structure for approximate range searching

» Cacheoblivious data structures for orthogonal range searching

» New Data Structures for Orthogonal Range Searching

» Supporting Range Queries on Web Data Using kNearest Neighbor Search

» Efficient Model Creation of Large Structures based on Range Segmentation

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CCCG
Authors	Mashhood Ishaque, Diane L. Souvaine, Nadia Benbernou

Comments (0)

Sciweavers

Data Structures for Restricted Triangular Range Searching

CCCG 2008 | Computational Geometry | Data Structures | Query Triangle | Triangular Emptiness |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers