Pages that link to "Item:Q1183506"
From MaRDI portal
The following pages link to Detecting the intersection of convex objects in the plane (Q1183506):
Displaying 12 items.
- Computational geometry in a curved world (Q911324) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- Detecting and decomposing self-overlapping curves (Q1200911) (← links)
- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time (Q1208431) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Computing two penetration measures for curved 2D objects (Q1607013) (← links)
- A two-dimensional ellipse-rectangle intersection test (Q1868501) (← links)
- An algorithm for the numerical detection of simplex overlap (Q1895105) (← links)
- Interval convex polygons (Q2740301) (← links)
- Classification and detection of obstructions to planarity (Q3201104) (← links)
