Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

11 relations
AlgorithmChan's algorithmComputational geometryConvex hull

Broader (1)

Convex hull algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Nonlinear Vibrations of a Mechanism for the Miller-Atkinson Cycle
The distribution mechanism for the Miller-Atkinson is presented based on some previous papers of the authors. The cam is obtained… 
2015
2015
Characterization of Mechanical Properties of Graphene-Modified Epoxy Resin for Pipeline Repair
This experimental study consists of a characterization of epoxy grout where an amount of 2% of graphene nanoplatelets particles… 
2012
2012
Application of the thru-network-line self-calibration method for free space material characterizations
Free space measurement systems can be used advantageously for non destructive and contactless material characterizations. These… 
2009
2009
Approximating a real number by a rational number with a limited denominator: A geometric approach
2009
2009
Long and short bristle wrapping toothbrush
Disclosed is a long and short bristle wrapping toothbrush, which comprises a toothbrush handle and toothbrush bristles, the… 
2008
2008
A Dynamic Area of Interest Management and Collaboration Model for P2P MMOGs
In this paper, we present a dynamic area of interest management for massively multiplayer online games (MMOG). Instead of mapping… 
Review
2007
Review
2007
Static and Dynamic Convex Hull Algorithms
I survey the existing static convex hull algorithms (Graham’s Scan, Jarvis’ March, and Chan’s optimal output-sensitive algorithm… 
2002
2002
EFFECT OF COMPOSITE FIBER WRAPS ON CORROSION OF REINFORCED CONCRETE COLUMNS IN A SIMULATED SPLASH ZONE
This research indicates that CFRP wrapping is potentially effective in reducing the effects of corrosion in specimens exposed to… 
1998
1998
An Associative Dynamic Convex Hull Algorithm
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the… 
1995
1995
Wrapping seeds increases yields and lowers losses
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)