Gift wrapping algorithm

Known as: Gift-wrapping algorithm, Jarvis's march, Jarvis Algorithm

In computational geometry, the gift wrapping algorithm is an algorithm for computing the convex hull of a given set of points.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

This experimental study consists of a characterization of epoxy grout where an amount of 2% of graphene nanoplatelets particles…

2012

Free space measurement systems can be used advantageously for non destructive and contactless material characterizations. These…

2009

2008

In this paper, we present a dynamic area of interest management for massively multiplayer online games (MMOG). Instead of mapping…

2002

Carbon fiber reinforced polymer (CFRP) composites have been shown to be particularly well suited for external strengthening of…

2002

This research indicates that CFRP wrapping is potentially effective in reducing the effects of corrosion in specimens exposed to…

1998

We study M theory on AdS4×RP 7 corresponding to 3 dimensional N = 8 superconformal field theory which is the strong coupling…

1998

This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the…

1996

This paper will present the implementation and comparison of new parallel algorithms for the convex hull problem. These…

1945