Code Directory
 Visual Basic & VB.NET
New Code
dbForge Studio for PostgreSQL 2.3.212
HTMLPad 2020 16.2
WeBuilder 2020 16.2
Rapid CSS 2020 16.2
Rapid PHP 2020 16.2
C# HTML to PDF 2020.8.1
Vue Injector 3.3
Spectrum Analyzer pro Live 2019
Devart Excel Add-in for HubSpot 2.1
RentALLScript - Airbnb clone 2.2
SuiteCRM Theme Customization 7.11.6
iScripts NetMenus 3.1
iScripts EasyIndex 2.2
iScripts EasySnaps 2.0
Top Code
IcrediBB Bulletin Board System 1.0
Skincare Management System for Scripts 1.4
Taxi Booking Script 1.0.4
Extreme Injector 3.7
Readability Analyzer 7.x-1.0-rc2
Sportsbook software by BOOKIE Software 3.01
Betting system 6.x-1.x-dev
Unix Time Stamp Calculator 1.0
Two Dimensional Random Walk 1.0
shopping mall management system 1.0
Uber Clone with Safety Measure Addons 2.0
phpEnter 5.1.
Single Leg MLM 1.2.1
Availability Booking Calendar PHP 1.0
Azizi search engine script PHP 4.1.10
Top Rated
Uber Clone with Safety Measure Addons 2.0
Answers phpSoftPro 3.12
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Apphitect Airbnb Clone Script 1.0
Deals and Discounts Website Script 1.0.2
Pro MLM 1
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
Convex hull and diameter of 2d point sets 
File ID: 66761

Convex hull and diameter of 2d point sets 
Download Convex hull and diameter of 2d point sets Error Link
License: Freeware
Downloads: 79
Submit Rating:
Convex hull and diameter of 2d point sets  Description
Description: Returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y). The convex hull algorithm is Graham's scan, using a coordinate-based sorted order rather than the more commonly seen radial sorted order. A rotating calipers algorithm generates candidate pairs of vertices for the diameter calculation. Care was taken handling tricky cases such as pairs of points with the same x-coordinate and colinear triples of points.

License: Freeware

Related: Algorithms


Downloads: 79

More Similar Code

In this work we present a generalization of partitional clustering aiming at the inclusion into the clustering process of both distance and direction of the point of observation towards the dataset. This is done by incorporating a new term in the objective function, accounting for the distance between the clustersd-deOao prototypes and the point of observation. It is a well known fact that the chosen number of partitions has a major effect on...

This recipe defines three context managers that make it easier to step in and out of different parameter sets (‘Attributes’), allows data inheritance on such data sets (‘Scope’) and lets remote interpreters behave likewise...

Find the minimum and maximum of 2D cell matrix, which may contain nested cell or numeric arrays.
These three functions calculate the minimum and maximum of all numbers within a 2-dimensional cell (or numeric) matrix.

The cell...

Emma (Extensible Multi Media Architecture) is an open-source, modular, extensible, dynamic framework for declarative authoring and display of 2D and 3D interactive multimedia. It uses Lua for scripting and Ogre3D for rendering.

Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the...

This simple code calculates the convex hull of a set of 2D points
and generates EPS files to visualise them. The algorithm was taken
from a textbook on Computional Geometry.

Two functions to find the value and position of the first min and max in a 2D matrix

This implementation includes modules for very fast loading and saving of n-dimensional, possibly colored and bulky point clouds. The proposed functions can also be used to load and save matrices in ASCII format.


returns a set of 2D coordinates from a 3D triangulated surface. 2D points are disposed inside a circle of unit radius so they represent a parametrization of the initial surface.

The triangulation is represented by the n x 3 t array.

The function "Return_points_polyg_direct" finds the subset of an arbitrarily large set of 2D points. This subset defines the convex polygon that includes all above points. The function accounts for aligned or identical points.

User Review for Convex hull and diameter of 2d point sets
- required fields

Please enter text on the image