Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We propose a statistical model for static and sliding friction between rough surfaces. Approximating the contact between rough… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
In this paper, first, we present a kinetic data structure for the problem of kinetic convex hull maintenance. After that, discuss… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Although vegetation has been positively linked to fear of crime and crime in a number of settings, recent findings in urban… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2001
2001
In the search for better approaches to magnetic fusion it is important to keep in mind the lessons learned in the 50 years that… Expand
Is this relevant?
1999
1997
1997
 
Is this relevant?
1989
1989
Les solutions stationnaires sont etudiees pour des solitons d'Alfven se propageant obliquement dans un champ magnetique homogene… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The problem of constructing the convex hull of a finite point set in a Euclidean space arises in many applications. In this paper… Expand
  • figure 1
  • figure 2
Is this relevant?
Review
1975
Review
1975
 
Is this relevant?