Reproduce “Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sarita de Berg, Tillmann Miltzow, Frank Staals
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.