Kinetic closest pair
id:
kinetic-closest-pair-258-18036414
title:
Kinetic closest pair
text:
A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize, so new static algorithms were developed to solve this problem.
brand slug:
wiki
category slug:
encyclopedia
description:
Kinetic data structure
original url:
https://en.wikipedia.org/wiki/Kinetic_closest_pair
date created:
date modified:
2022-02-12T12:24:30Z
main entity:
{"identifier":"Q6410773","url":"https://www.wikidata.org/entity/Q6410773"}
image:
fields total:
13
integrity:
14