A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
type: Item
instance of: scholarly article
title: A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
author: Yuping Cui
author: Guolei Zheng
published in: Journal of Global Optimization
publication date: 2024-10-14T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7925626
zbMATH Keywords: convex hull
zbMATH Keywords: generic polygon
zbMATH Keywords: curve
zbMATH Keywords: elastic envelop
zbMATH Keywords: supporting line
zbMATH Keywords: incremental algorithm
MaRDI profile type: Publication
cites work: Packing convex polygons in minimum-perimeter convex hulls
cites work: A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
cites work: Near optimal minimal convex hulls of disks
cites work: A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
cites work: QuickhullDisk: a faster convex hull algorithm for disks
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: On the identification of the convex hull of a finite set of points in the plane
cites work: Convex hulls of finite sets of points in two and three dimensions
cites work: The complexity of incremental convex hull algorithms in \(R^ d\)
cites work: The quickhull algorithm for convex hulls
cites work: Measuring Concavity on a Rectangular Mosaic
cites work: A linear algorithm for finding the convex hull of a simple polygon
cites work: On finding the convex hull of a simple polygon
cites work: A linear time algorithm for obtaining the convex hull of a simple polygon
cites work: On-line construction of the convex hull of a simple polyline
cites work: A convex hull algorithm for discs, and applications
cites work: Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
cites work: Convex hull of a planar set of straight and circular line segments
cites work: On computing the convex hull of (piecewise) curved objects
cites work: Optimal clustering of a pair of irregular objects
cites work: Packing circles into perimeter-minimizing convex hulls
DOI: 10.1007/S10898-024-01409-W
description: scientific article; zbMATH DE number 7925626