Pages that link to "Item:Q4190154"

The following pages link to An optimal real-time algorithm for planar convex hulls (Q4190154):

Displaying 30 items.

• Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
• Inconstancy of finite and infinite sequences (Q533867) (← links)
• Interval scheduling on related machines (Q547142) (← links)
• Space-efficient planar convex hull algorithms (Q596137) (← links)
• Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
• The complexity of incremental convex hull algorithms in \(R^ d\) (Q800085) (← links)
• Topological sweep of the complete graph (Q1003474) (← links)
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
• On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
• On-line construction of the convex hull of a simple polyline (Q1107996) (← links)
• Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
• Maintenance of configurations in the plane (Q1158972) (← links)
• Steady-paced-output and fractional-on-line algorithms on a RAM (Q1170881) (← links)
• Computing the convex hull in a hammock (Q1177390) (← links)
• Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
• Geometrical tools in classification (Q1350810) (← links)
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
• An algorithm for discrete approximation by quasi-convex functions on \(R^m\) (Q1767886) (← links)
• Lower bounds for maximal and convex layers problems (Q1825651) (← links)
• Connected component and simple polygon intersection searching (Q1918994) (← links)
• Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
• Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
• On finding the convex hull of a simple polygon (Q3331831) (← links)
• The convex hull of a set of convex polygons (Q3989788) (← links)
• Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
• COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
• Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
• Connected component and simple polygon intersection searching (Q5060096) (← links)