Pages that link to "Item:Q5896232"
From MaRDI portal
The following pages link to Finding the convex hull of a simple polygon (Q5896232):
Displaying 45 items.
- Multilevel Monte Carlo front-tracking for random scalar conservation laws (Q285286) (← links)
- A new elementary geometric approach to option pricing bounds in discrete time models (Q320923) (← links)
- Setting defect charts control limits to balance cycle time and yield for a tandem production line (Q337306) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- Finding the convex hull of a simple polygon in linear time (Q1096406) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder (Q1099952) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- On-line construction of the convex hull of a simple polyline (Q1107996) (← links)
- A lower bound on the complexity of the convex hull problem for simple polyhedra (Q1107997) (← links)
- A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
- The Bohnenblust-Spitzer algorithm and its applications (Q1612308) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- The order of points on the second convex hull of a simple polygon (Q1895970) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- On finding the convex hull of a simple polygon (Q3331831) (← links)
- Method of orienting curves for determining the convex hull of a finite set of points in the plane (Q3553761) (← links)
- Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← links)
- The convex hull of a set of convex polygons (Q3989788) (← links)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
- Continuous Center Problems (Q5506719) (← links)
- Fast skeleton construction (Q6102331) (← links)
- Robust explicit estimators using the power-weighted repeated medians (Q6579833) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6615413) (← links)
