s

straightedge

Includes 2 main parts: - Path finding through 2D polygons using the A star algorithm and navigation-mesh generation Field of vision / shadows / line of sight / lighting. The basic polygon and point classes are the KPolygon and KPoint. KPolygon contains a list of KPoints for vertices as well as a center (centroid), area, and radius (circular bound or distance from center to furthest point). KPolygon was born out of the need for a more game-oriented and flexible polygon class than the Path2D class in the standard Java library. KPolygon implements java.awt.geom.Shape so it can be easily drawn and filled by Java2D's Graphics2D object. - This API provides path-finding and field-of-vision. For other complex geometric operations such as buffering (fattening and shrinking) and constructive area geometry (intersections and unions) it is recommended to use the excellent Java Topology Suite (JTS). The standard Java2D library also provides the Area class which can be used for some constructive area geometry operations. Note that there is a utility class PolygonConverter that can quickly convert KPolygons to JTS polygons and vice versa.
https://github.com/rpax/straightedge
New BSD License
Keith Woodward Rafael Pax
need using unions kpoint vertices geom kpolygon parts contains used filled centroid center polygon circular more basic oriented generation mesh versa such java2d class shape flexible geometry that navigation than constructive radius suite some this born complex other vice convert recommended easily line polygonconverter excellent from object through well includes geometric algorithm sight distance area finding path kpoints shrinking topology polygons drawn note classes buffering standard fattening vision star graphics2d provides list game shadows main field point intersections kpolygons which lighting utility furthest there library implements java operations also quickly bound path2d
Aggregated version Version Update time
0.8 0.8 Dec 21, 2015
1 Records