Mercurial > traipse_dev
view orpg/mapper/map_utils.py @ 97:bb22f0f1a7ec alpha
Traipse Alpha 'OpenRPG' {090924-01}
Traipse is a distribution of OpenRPG that is designed to be easy to setup and go. Traipse also makes it easy for developers to work on code without fear of sacrifice. 'Ornery-Orc' continues the trend of 'Grumpy' and adds fixes to the code. 'Ornery-Orc's main goal is to offer more advanced features and enhance the productivity of the user.
Update Summary:
00:
Update forwards to the 090909-02 Server code that now works.
New default Lobby Map, designed for Traipse. Feel free to change it.
Updates to Server GUI:
* Admin can Ban from Backend.
* Prework to modify Ban List in back end.
* Server GUI finds your Lobby Name
* New users default as Lurker unless a Role is set
New Addition to Chat Die Roll commands. Math Ordering. Ex. [(X+Y)dZ]. Currently does pairs only, no nesting either.
Cleaner TraipseSuiteAttention portability and clean up in Main (Beta!)
01:
Die Roll Commands addition removed in favor of Core code
author | sirebral |
---|---|
date | Thu, 24 Sep 2009 21:21:49 -0500 |
parents | 449a8900f9ac |
children |
line wrap: on
line source
""" file: map_utils.py This file contains generic utility functions for use in the openrpg mapping system """ import math """ distance_between() Returns the distance between two points """ def distance_between( x1, y1, x2, y2 ): "Returns the distance between two points" dx = x2 - x1 dy = y2 - y1 return math.sqrt( dx*dx + dy*dy ) """ proximity_test() Tests if 'test_point' (T) is close (within 'threshold' units) to the line segment 'start_point' to 'end_point' (PQ). The closest point (R) to T on the line PQ is given by: R = P + u (Q - P) TR is perpendicular to PQ so: (T - R) dot (Q - P) = 0 Solving these two equations gives the equation for u (see below). If u < 0 or u > 1 then R is not within the line segment and we simply test against point P or Q. """ def proximity_test( start_point, end_point, test_point, threshold ): "Test if a point is close to a line segment" x1,y1 = start_point x2,y2 = end_point xt,yt = test_point x1 = float(x1) x2 = float(x2) y1 = float(y1) y2 = float(y2) xt = float(xt) yt = float(yt) # Coincident points? if x1 == x2 and y1 == y2: d = distance_between(xt, yt, x1, y1) else: dx = x2 - x1 dy = y2 - y1 u = ((xt - x1) * dx + (yt - y1) * dy) / (dx*dx + dy*dy) if u < 0: d = distance_between(xt, yt, x1, y1) elif u > 1: d = distance_between(xt, yt, x2, y2) else: xr = x1 + u * dx yr = y1 + u * dy d = distance_between(xt, yt, xr, yr) return d <= threshold