Pages that link to "Item:Q2775708"
From MaRDI portal
The following pages link to A fast algorithm to decide the inclusion of a point in the convex hull of a two-dimensional point set (Q2775708):
Displaying 4 items.
- Efficient algorithms for testing membership of a point in polygons and polyhedra (Q1325999) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- A novel point inclusion test for convex polygons based on Voronoi tessellations (Q2242626) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
