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
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… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • figure 3
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
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
1997
1997
We studied the interplay between kinetic roughening and phase ordering in a (1+1)-dimensional single-step solid-on-solid growth… Expand
1989
1989
Les solutions stationnaires sont etudiees pour des solitons d'Alfven se propageant obliquement dans un champ magnetique homogene… Expand
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