Pages that link to "Item:Q1134524"

The following pages link to A linear algorithm for finding the convex hull of a simple polygon (Q1134524):

Displaying 36 items.

• Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
• The symmetric all-furthest-neighbor problem (Q789727) (← links)
• A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775) (← links)
• Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
• Some chain visibility problems in a simple polygon (Q911765) (← links)
• A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
• On the conditions for success of Sklansky's convex hull algorithm (Q1053994) (← links)
• A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995) (← links)
• A convex hull algorithm for planar simple polygons (Q1060850) (← links)
• Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
• Finding the convex hull of a simple polygon in linear time (Q1096406) (← 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)
• On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← 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)
• Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
• On separating two simple polygons by a single translation (Q1825657) (← links)
• Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
• Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
• Staircase visibility and computation of kernels (Q1894710) (← links)
• Optimizing generalized kernels of polygons (Q2046316) (← links)
• Three problems about simple polygons (Q2432735) (← links)
• The Erdős--Nagy theorem and its ramifications (Q2486085) (← links)
• Approximate convex decomposition of polygons (Q2507162) (← links)
• COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
• On finding the convex hull of a simple polygon (Q3331831) (← links)
• An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
• PLANAR STRONG VISIBILITY (Q4818579) (← links)
• Filling polyhedral molds (Q5060114) (← links)
• Guarding Exterior Region of a Simple Polygon (Q5452157) (← links)
• A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)