Pages that link to "Item:Q1198024"
From MaRDI portal
The following pages link to Optimal time bounds for some proximity problems in the plane (Q1198024):
Displaying 7 items.
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
