On finding the convex hull of a simple polygon
From MaRDI portal
Publication:3331831
DOI10.1007/BF00993195zbMath0543.52002OpenAlexW2085761844MaRDI QIDQ3331831
No author found.
Publication date: 1983
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00993195
Related Items
Shattering a set of objects in 2D, Generalized Delaunay triangulation for planar graphs, Finding the convex hull of a simple polygon in linear time, Staircase visibility and computation of kernels, On-line construction of the convex hull of a simple polyline, A lower bound on the complexity of the convex hull problem for simple polyhedra, Fast skeleton construction, Three problems about simple polygons, Some chain visibility problems in a simple polygon, A new algorithm for computing the convex hull of a planar point set, Space-time trade-offs for stack-based algorithms, Steiner hull algorithm for the uniform orientation metrics, Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time, An efficient algorithm for finding the CSG representation of a simple polygon, An approximate algorithm for the minimal vertex nested polygon problem, Optimal computation of finitely oriented convex hulls, Unnamed Item, A linear time algorithm for computing the convex hull of an ordered crossing polygon, On the conditions for success of Sklansky's convex hull algorithm, A linear time algorithm for obtaining the convex hull of a simple polygon, A convex hull algorithm for planar simple polygons, Numerical stability of a convex hull algorithm for simple polygons, Convex hulls of objects bounded by algebraic curves, Optimal Steiner hull algorithm
Cites Work
- A linear algorithm for finding the convex hull of a simple polygon
- Another efficient algorithm for convex hulls in two dimensions
- On the complexity of finding the convex hull of a set of points
- The all nearest-neighbor problem for convex polygons
- Convex hull of a finite set of points in two dimensions
- A fast convex hull algorithm
- An efficient algorithm for determining the convex hull of a finite planar set
- A counterexample to an algorithm for computing monotone hulls of simple polygons
- Convex hulls of finite sets of points in two and three dimensions
- A New Convex Hull Algorithm for Planar Sets
- An optimal real-time algorithm for planar convex hulls
- Measuring Concavity on a Rectangular Mosaic
- Finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon
