Pages that link to "Item:Q1107996"

The following pages link to On-line construction of the convex hull of a simple polyline (Q1107996):

Displaying 44 items.

• Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
• Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
• Lyndon + Christoffel = digitally convex (Q834259) (← links)
• Tangential cover for thick digital curves (Q834266) (← links)
• A simple algorithm for digital line recognition in the general case (Q877107) (← links)
• A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
• Optimal simplification of polygonal chains for subpixel-accurate rendering (Q950399) (← links)
• Triangulating input-constrained planar point sets (Q975526) (← links)
• Parameter identification of 1D fractal interpolation functions using bounding volumes (Q1034661) (← links)
• A simple algorithm for determining the envelope of a set of lines (Q1182080) (← links)
• An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
• Stabbing information of a simple polygon (Q1283786) (← links)
• Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
• A workbench for computational geometry (Q1322571) (← links)
• Geometric preservation of 2D digital objects under rigid motions (Q1722617) (← links)
• Optimizing squares covering a set of points (Q1749537) (← links)
• On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
• Attraction-convexity and normal visibility (Q1984610) (← links)
• Optimizing generalized kernels of polygons (Q2046316) (← links)
• Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
• Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
• Covering paths for planar point sets (Q2250054) (← links)
• Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
• Three problems about simple polygons (Q2432735) (← links)
• The Erdős--Nagy theorem and its ramifications (Q2486085) (← links)
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
• Linear segmentation of discrete curves into blurred segments (Q2573242) (← links)
• Optimizing Squares Covering a Set of Points (Q2942380) (← links)
• COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
• Adaptive Planar Point Location (Q5009786) (← links)
• Filling polyhedral molds (Q5060114) (← links)
• Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)
• GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
• Tangential Cover for Thick Digital Curves (Q5458903) (← links)
• Polygons cuttable by a circular saw (Q5952972) (← links)
• Finding approximately convex ropes in the plane (Q6157950) (← links)
• Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)
• The rectilinear convex hull of line segments (Q6546584) (← links)
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)
• Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
• A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)