An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points

doi:10.4038/cjs.v50i3.7907

An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points

Ceylon Journal of Science · 2021

https://doi.org/10.4038/cjs.v50i3.7907

Read at the publisher Citation tracking 🔒

This index records bibliographic metadata and links to the publisher's own page. It does not host or link directly to full text. Citations recorded: 1.