Pages that link to "Item:Q917298"
From MaRDI portal
The following pages link to Computing the longest diagonal of a simple polygon (Q917298):
Displaying 6 items.
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Computing a maxian point of a simple rectilinear polygon (Q2643818) (← links)
- Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)