```
public class Mesh
extends java.lang.Object
```
a set of irregularly spaced interconnected points: all (x,y,z) coordinates are relative to the center of a (-0.5 to +0.5) unit-cube. Once created, the mesh (collection of connected points) does not change, but the attributes of the individual points (e.g. altitude and hydration) do evolve over time). The intent is that all other maps, even though much more detailed than the mesh, should be deterministically derivable from the mesh and its parameters. Notes on generation: O'Leary observed that a map created on a square grid never loses its regularity, so he wanted to build the map on an irregular grid. But he found randomly chosen grids to be too irregular. Mesh generation implements his compromise. 1. He starts by generating N completely randomly chosen points. But these turn out to be a little to clumpy, so he smoothes them out (improves them) by finding the Voronoi polygons around those points and using their vertices. 2. He uses those (improved) points as the centers for a second Voronoi tesselation, whose vertices become the map points, and whose edges become a connected mesh (each internal point has three neighbors).

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`MeshPoint`	`choosePoint(double x, double y)`	find the MeshPoint closest to a map coordinate
`void`	`makeMesh(MeshPoint[] points)`	turn a set of points into a mesh
`MeshPoint[]`	`makePoints(int numpoints)`	create a set of mesh points
`void`	`read(java.lang.String filename)`	read mesh of MapPoints from a file

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Class Mesh