Pages that link to "Item:Q1251803"

The following pages link to Convex hull of a finite set of points in two dimensions (Q1251803):

Displaying 20 items.

• Graphical exploration of the weight space in three-objective mixed integer linear programs (Q320624) (← links)
• Randomized quickhull (Q675302) (← links)
• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
• Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
• Some performance tests of convex hull algorithms (Q1070524) (← links)
• Quasi-convex optimization (Q1078102) (← 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 finding the convex hull of a simple polygon (Q1134524) (← links)
• Another efficient algorithm for convex hulls in two dimensions (Q1134526) (← links)
• Further comments on Bykat's convex hull algorithm (Q1147518) (← links)
• Computing the convex hull in a hammock (Q1177390) (← links)
• Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation (Q1371879) (← links)
• Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
• A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
• QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
• Quicker than Quickhull (Q2354631) (← links)
• A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
• On finding the convex hull of a simple polygon (Q3331831) (← links)
• Multi-core Implementations of Geometric Algorithms (Q3644727) (← links)