Kinetic convex hull

A kinetic convex hull data structure is a kinetic data structure that maintains the convex hull of a set of continuously moving points.
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2011
0120012011

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this paper, first, we present a kinetic data structure for the problem of kinetic convex hull maintenance. After that, discuss… (More)
  • figure 1
  • table 1
Is this relevant?
Review
2008
Review
2008
Although vegetation has been positively linked to fear of crime and crime in a number of settings, recent findings in urban… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2007
2007
In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
2006
2006
We propose and study a novel data-structuring paradigm, called active data structures. Like a time machine, active data… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2001
Review
2001
Although vegetation has been positively linked to fear of crime and crime in a number of settings, recent findings in urban… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?