z-logo
open-access-imgOpen Access
An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
Author(s) -
K. R. Wijeweera,
S. R. Kodituwakku
Publication year - 2021
Publication title -
ceylon journal of science
Language(s) - English
Resource type - Journals
eISSN - 2513-230X
pISSN - 2513-2814
DOI - 10.4038/cjs.v50i3.7907
Subject(s) - ceylon , convex hull , sri lanka , boundary (topology) , set (abstract data type) , mathematics , combinatorics , regular polygon , hull , polygon (computer graphics) , computer science , history , geometry , geology , ancient history , mathematical analysis , oceanography , south asia , programming language , telecommunications , frame (networking)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom