A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets Prayaag Venkat∗ Abstract A data structure is said to be succinct if it uses an - Succinct data structure - Document - PDFSEARCH.IO

First Page	Meta Content
	A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets Prayaag Venkat∗ Abstract A data structure is said to be succinct if it uses an Add to Reading List Document Date: 2014-06-20 23:53:44 Open Document File Size: 301,62 KB Share Result on Facebook

A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets Prayaag Venkat∗ Abstract A data structure is said to be succinct if it uses anAdd to Reading List