Timeline for Find, in linear time, a line that intersects all the segments and has the largest possible slope, or determine that there is no such line
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25 at 13:11 | review | Close votes | |||
| Jul 10 at 3:02 | |||||
| Jun 25 at 12:53 | comment | added | EnEm | Does this answer your question? Determine if there exists a line that intersects all horizontal segments. Better than $O(n^2 \lg n)$? | |
| Jun 25 at 6:50 | history | edited | xskxzr | CC BY-SA 4.0 |
deleted 13 characters in body; edited tags
|
| Jun 23 at 16:16 | comment | added | HEKTO | cs.stackexchange.com/questions/103686/… | |
| Jun 21 at 8:23 | comment | added | greybeard | Start with two segments. What changes when you add a third? What about collinear segments? | |
| Jun 20 at 20:10 | comment | added | EnEm | What is the context where you have encountered this problem? Can you credit the original source? | |
| S Jun 20 at 16:14 | review | First questions | |||
| Jun 25 at 6:50 | |||||
| S Jun 20 at 16:14 | history | asked | K. Stuhl | CC BY-SA 4.0 |