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

First Page		Document Content
Date: 2014-06-20 23:53:44		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 Source URL: www.cccg.ca Download Document from Source Website File Size: 301,62 KB Share Document on Facebook