Pages that link to "Item:Q1824391"
From MaRDI portal
The following pages link to Does a point lie inside a polygon ? (Q1824391):
Displaying 12 items.
- Does contraction preserve triangular meshes? (Q676930) (← links)
- A robust method for calculating the simplicity and orientation of planar polygons (Q1183524) (← links)
- Computational methods in Lagrangian and Eulerian hydrocodes (Q1205070) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Efficient algorithms for testing membership of a point in polygons and polyhedra (Q1325999) (← links)
- Pseudo-characteristic functions for convex polyhedra (Q1769714) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- A novel point inclusion test for convex polygons based on Voronoi tessellations (Q2242626) (← links)
- A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty. (Q2742360) (← links)
- Point in polygon problem via homotopy and Hopf's degree theorem (Q2789222) (← links)
- A fast modification of Focke's shortest inpolygon construction (Q3978583) (← links)
- An optimal online algorithm for halfplane intersection (Q5938679) (← links)
