Abstract
A dynamic data structure is given that maintains the minimal distance in a set ofn points ink-dimensional space inO((logn)k log logn) amortized time per update. The size of the data structure is bounded byO(n(logn)k). Distances are measured in the MinkowskiLt-metric, where 1 ≤t ≤ ?. This is the first dynamic data structure that maintains the minimal distance in polylogarithmic time for fully on-line updates.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
