Class Overview
An implementation of Ramer-Douglas-Peucker algorithm for geometry simplification.
Simplifier works on lines and polygons.
Simplification is done in two passes - first pass uses fast Radial Distance vertex rejection,
second pass uses Ramer-Douglas-Peuckerworst algorithm (with worst case quadratic complexity).
Summary
Public Methods |
synchronized
void
|
delete()
|
[Expand]
Inherited Methods |
From class
com.carto.geometry.GeometrySimplifier
synchronized
void
|
delete()
|
boolean
|
equals(Object obj)
Checks if this object is equal to the specified object.
|
int
|
hashCode()
Returns the hash value of this object.
|
|
From class
java.lang.Object
boolean
|
equals(Object arg0)
|
final
Class<?>
|
getClass()
|
int
|
hashCode()
|
final
void
|
notify()
|
final
void
|
notifyAll()
|
String
|
toString()
|
final
void
|
wait(long arg0, int arg1)
|
final
void
|
wait(long arg0)
|
final
void
|
wait()
|
|
Public Constructors
public
DouglasPeuckerGeometrySimplifier
(float tolerance)
Constructs a new simplifier, given tolerance.
Parameters
tolerance |
The maximum error for simplification. The tolerance value gives maximum error in pixels.
|
Public Methods
public
synchronized
void
delete
()