Finding the convex hull of a simple polygon
From MaRDI portal
(Redirected from Finding the convex hull of a simple polygon)
Recommendations
- On finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon in linear time
- Finding the convex hull facet by facet
- A convex hull algorithm for planar simple polygons
- scientific article; zbMATH DE number 522850
- The convex hull of a set of convex polygons
- scientific article; zbMATH DE number 4045150
- scientific article; zbMATH DE number 742638
- scientific article; zbMATH DE number 3849983
- Finding Extremal Polygons
Cited in
(62)- Lipschitz condition in minimum norm problems on bounded functions
- Generalized Delaunay triangulation for planar graphs
- Finding the convex hull of a simple polygon in linear time
- On determining the on-line minimax linear fit to a discrete point set in the plane
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- 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
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- Computing external farthest neighbors for a simple polygon
- Optimal time bounds for some proximity problems in the plane
- An efficient algorithm for finding the CSG representation of a simple polygon
- Numerical stability of a convex hull algorithm for simple polygons
- The Bohnenblust-Spitzer algorithm and its applications
- Constructing the convex hull of a partially sorted set of points
- Optimal computation of finitely oriented convex hulls
- On computing the closest boundary point on the convex hull
- Staircase visibility and computation of kernels
- The order of points on the second convex hull of a simple polygon
- Three problems about simple polygons
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- A linear time algorithm to remove winding of a simple polygon
- Relative convex hull determination from convex hulls in the plane
- Multilevel Monte Carlo front-tracking for random scalar conservation laws
- Computational and structural advantages of circular boundary representation
- scientific article; zbMATH DE number 2089211 (Why is no real title available?)
- A new elementary geometric approach to option pricing bounds in discrete time models
- scientific article; zbMATH DE number 3848644 (Why is no real title available?)
- On finding the convex hull of a simple polygon
- Setting defect charts control limits to balance cycle time and yield for a tandem production line
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- Some computational aspects of geodesic convex sets in a simple polygon
- scientific article; zbMATH DE number 3945383 (Why is no real title available?)
- The Ultimate Planar Convex Hull Algorithm?
- scientific article; zbMATH DE number 4045150 (Why is no real title available?)
- Convex hulls of piecewise-smooth Jordan curves
- scientific article; zbMATH DE number 4060714 (Why is no real title available?)
- The convex hull of a set of convex polygons
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- EXACT AND OPTIMAL CONVEX HULLS IN 2D
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
- scientific article; zbMATH DE number 857627 (Why is no real title available?)
- Continuous center problems
- tigers
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Fast skeleton construction
- Robust explicit estimators using the power-weighted repeated medians
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Dynamic convex hulls for simple paths
- Efficient computation of crossing components and shortcut hulls
- Crossing-free monochromatic trees for bicolored point sets
- Dynamic convex hulls for simple paths
- A simple algorithm for computing the smallest enclosing circle
- Convex hulls of objects bounded by algebraic curves
- Root radii and subdivision for polynomial root-finding
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
- Computational geometry in a curved world
- An optimal algorithm for computing a minimum nested nonconvex polygon
This page was built for publication: Finding the convex hull of a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896232)
