Pages that link to "Item:Q1822240"
From MaRDI portal
The following pages link to A simple linear algorithm for intersecting convex polygons (Q1822240):
Displaying 16 items.
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- A robust method for calculating the simplicity and orientation of planar polygons (Q1183524) (← links)
- Efficient algorithms for testing membership of a point in polygons and polyhedra (Q1325999) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- An algorithm for the numerical detection of simplex overlap (Q1895105) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- A linear algorithm for determining the separation of convex polyhedra (Q3697818) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- (Q4256651) (← links)
- EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS (Q4818556) (← links)
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693) (← links)
- Three‐dimensional discrete element simulation for granular materials (Q5190540) (← links)
- (Q5368724) (← links)