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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The paper is devoted to approximating the multi-dimensional Edgeworth-Pareto Hull, which is a tool for decision support in multi… 
2009
2009
We present a new (1+ε)-spanner for sets of n points in R<sup>d</sup>. Our spanner has size O(n/ε<sup>d-1</sup>) and maximum… 
2008
2008
We present a new and simple (1+ε)-spanner of size <i>O</i>(<i>n</i>ε<sup>2</sup>) for a set of <i>n</i> points in the plane… 
2008
2008
Protein crystals grow by the incorporation of growth units from solution into the crystal bulk. At low supersaturation, growth… 
2000
2000
In this article we investigate the use of time distributions in retrieval tasks. Specifically, we introduce a novel term… 
1997
1993
1990
1990
Les solutions stationnaires sont etudiees pour des solitons d'Alfven se propageant obliquement dans un champ magnetique homogene… 
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…