A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines

Cites Work

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
The complexity of incremental convex hull algorithms in \(R^ d\)
A linear time algorithm for obtaining the convex hull of a simple polygon
On-line construction of the convex hull of a simple polyline
A linear algorithm for finding the convex hull of a simple polygon
A convex hull algorithm for discs, and applications
On computing the convex hull of (piecewise) curved objects
Optimal clustering of a pair of irregular objects
Near optimal minimal convex hulls of disks
A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
QuickhullDisk: a faster convex hull algorithm for disks
Packing circles into perimeter-minimizing convex hulls
An efficient algorithm for determining the convex hull of a finite planar set
On the identification of the convex hull of a finite set of points in the plane
Packing convex polygons in minimum-perimeter convex hulls
On finding the convex hull of a simple polygon
Convex hulls of finite sets of points in two and three dimensions
The quickhull algorithm for convex hulls
Convex hull of a planar set of straight and circular line segments
Measuring Concavity on a Rectangular Mosaic

This page was built for publication: A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618153)