Skip to search formSkip to main contentSkip to account menu

Dynamic convex hull

The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This study investigated the relationship between texting and attention. Specifically, the ability to comprehend visual cues as… 
Review
2015
Review
2015
The Shared Prosperity Kalamazoo Initiative acts a combatant to reducing poverty for the City of Kalamazoo rather than a solution… 
2013
2013
This paper formulates the coordination control for homogeneous linear multi-agent systems under network topology without any… 
2007
2007
The dynamic convex hull problem was recently solved in O(lg n) time per operation, and this result is best possible in models of… 
Review
2007
Review
2007
I survey the existing static convex hull algorithms (Graham’s Scan, Jarvis’ March, and Chan’s optimal output-sensitive algorithm… 
2003
2003
Home schooling, as an alternate model of education, is emerging as a growing educational phenomenon throughout Australia. This… 
1998
1998
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the… 
1996
1996
An algorithm for constructing dynamic convex hull of n points in the plane based on the new criteria for determination of vertex…