Skip to search formSkip to main contentSkip to account menu

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.
2007
2007
We study the shape stability of disks moving in an external Laplacian field in two dimensions. The problem is motivated by the… 
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… 
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… 
1997
1989
1989
Les solutions stationnaires sont etudiees pour des solitons d'Alfven se propageant obliquement dans un champ magnetique homogene… 
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… 
1949
1949
DR. R. A. HULL was killed at the age of thirty-eight when he fell while climbing the Brouillard ridge of Mont Blanc on August 22…