Stop the war!
Остановите войну!
for scientists:
default search action
"An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex ..."
Pratul Dublish (1988)
- Pratul Dublish:
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon. Inf. Process. Lett. 29(5): 275-276 (1988)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.