Pages that link to "Item:Q1325999"
From MaRDI portal
The following pages link to Efficient algorithms for testing membership of a point in polygons and polyhedra (Q1325999):
Displaying 5 items.
- 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)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- A fast algorithm to decide the inclusion of a point in the convex hull of a two-dimensional point set (Q2775708) (← links)
- Point in polygon problem via homotopy and Hopf's degree theorem (Q2789222) (← links)
