Jump to content

Region and Chokepoint detection: an interesting paper


Recommended Posts

I've been trying for the past couple days to implement a convincing system to detect chokepoints in Marilyn, and failed. Searched the internet, and found this paper, which suggest a freely available API already exists, coded in C++, to deal with exactly such things.

Any chance this could get into 0 AD? Adaptability can be a concern, but given the input received, I think it shouldn't be too hard to adapt.

Link to comment
Share on other sites

This looks pretty interesting. The algorithm seems to work very well with the starcraft maps. Hopefully this would translate to 0 AD maps well, though since 0 AD maps are typically more open I would expect there to be a larger rate of false positives. With some pruning this shouldn't be an issue though.

The library they provide looks pretty Starcraft focused, it looks fairly strongly bound to bwapi which is not great. It might be easier to start from the CGAL library since the operations performed on the Voronoi Diagram look relatively straightforward.

Link to comment
Share on other sites

I didn't look into the code, if they only rely on bwapi for the initial phase, it should be fairly updatable, but if there are more calls, indeed it could be "easier" to simply recreate everything. It could also be more suited to 0 A.D., which has you said has more open-ended maps.

I'm also unsure whether Starcraft has water... I've never played it, but this would require two different settings in the algorithm I guess.

I think it's the way to go for the AIs though, because chokepoints could really be useful, particularly for pathfinding and strategic defense.

(0 A.D. also has some "open-ended with chokepoints" type map, such as Oasis, where the behavior of the algorithm would have to be tested.

Edited by wraitii
Link to comment
Share on other sites

  • 3 months later...

IMHO, this sort of thing could be built into the pathfinder itself. And maybe the pathfinder could even go a step further than the paper.

The Voronoi partitioning could be combined with a summed area table, which would make it dead easy to approximate how crowded a square region is (including objects like trees, etc!) and avoid it... if that makes sense.

Edited by myconid
Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

 Share

×
×
  • Create New...