Line Bounded Area Pathfinding Library

Status: Inactive

Brought to you by: kspes

Add a Review

Downloads: 0 This Week

Last Update: 2015-08-30

Browse Code

Get an email when there's a new version of Line Bounded Area Pathfinding Library

An abstract path finding library that finds a path in a simple or complex area bounded by lines. Targeted at game developers, most usable in adventure games.

Project Activity

See All Activity >

Follow Line Bounded Area Pathfinding Library

Line Bounded Area Pathfinding Library Web Site

Other Useful Business Software

Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.

Start Free

Rate This Project

User Reviews

Be the first to post a review of Line Bounded Area Pathfinding Library!

Additional Project Details

Intended Audience

Developers

Registered

2010-03-09

Report inappropriate content

Ship Agents Faster

Transform your applications and workflows into powerful agentic systems at global scale.

Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.

Start Free

Recommended Projects

Line Counter
Line Counter is a small VB.NET project which helps you to count how many lines (and chars) you coded in a project or just count how many lines (comments, blank lines, code) in a file. Also include a usable DLL.
JSoko
The Sokoban game implemented in Java.
Path Defense Framework
A framework for games with defense towers along a path.
Area and Volume
This program can calculate the area and volume for various 2D and 3D shapes such as Rectangles, Parallelograms, Prisms, Pyramids, and Spheres. To install: Download the .exe file.
Argorha pathfinding
Argorha Pathfinding is an algorithm which permit you to find your way into a polygon soup ( 3D world ) efficently by precalculating a system of sectors and portals. AStar included. Demo in Download section, code on SVN.