Chasing puppies on orthogonal straight-line plane graphs
Reading time: 1 minute
...
📝 Original Info
- Title: Chasing puppies on orthogonal straight-line plane graphs
- ArXiv ID: 2503.05216
- Date: 2025-03-07
- Authors: ** 정보 없음 – 논문에 저자 정보가 제공되지 않았습니다. 저자명 및 소속을 확인하려면 원문 혹은 학술 데이터베이스를 참고하시기 바랍니다. **
📝 Abstract
Assume that you have lost your puppy on an embedded graph. You can walk around on the graph and the puppy will run towards you at infinite speed, always locally minimizing the distance to your current position. Is it always possible for you to reunite with the puppy? We show that if the embedded graph is an orthogonal straight-line embedding the answer is yes.💡 Deep Analysis
📄 Full Content
Reference
This content is AI-processed based on open access ArXiv data.