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.

2018

The distribution mechanism for the Miller-Atkinson is presented based on some previous papers of the authors. The cam is obtained…

2016

This report discusses a new method of identifying erroneous data in temperature and salinity (T/S) profiles measured by Argo…

2015

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

2012

Objective To investigate the etiology and treatment of phallic wrapping fistula.Methods Clinical data of 11 cases with phallic…

2009

Disclosed is a long and short bristle wrapping toothbrush, which comprises a toothbrush handle and toothbrush bristles, the…

2007

FRP–wrapping of columns is considered one of the most effective retrofitting techniques for RC structures in seismic regions…

2007

This paper describes the techniques used to resolve invalid connectivity created as a natural part of the whisker weaving…

1998

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

1995

1945