ILWIS

WORLD INSTITUTE FOR CONSERVATION & ENVIRONMENT, WICE

Home Up

SITE MAP

Check out our favorite jungle

LEARN ABOUT RANGERS

METHODOLOGY

NATURE PICTURES

 FREE SOFTWARE ! 

 DON'T CLICK HERE 

WORLD REGIONS

NORTH AMERICA

CENTRAL AMERICA

SOUTH AMERICA

WEST AFRICA

EUROPE

EAST AFRICA

WESTERN ASIA

SOUTH-EAST ASIA

NORTHERN ASIA

ISLANDS & POLES

WHY BIRDS

MAMMALS

ECOSYSTEMS

CORAL REEFS

NATIONAL PARKS

MONITORING NATURE

GIS FOR EVERYONE

DOWNLOAD ILWIS FREE !

BIRDSHOUSES

BIRDFEEDERS

WORLD BIRDLIST

AVES

VOGEL

OISEAUX

WICE

 

NEW ILWIS 3.7 VECTOR FUNCTIONS

New ILWIS 3.7 vector functions

PointMapUnion
PointMapIntersect
PointMapSymetricDifference
PointMapDifference
PointMapRelate
SegmentMapVoronoi
SegmentMapTin ( not sure yet if this one will make it to the final)
SegmentMapUnion
SegmentMapIntersect
SegmentMapSymetricDifference
SegmenMapDifference
SegmentMapRelate
PolygonMapBuffer
PolygonMapConvexHull
PolygonMapUnion
PolygonMapIntersect
PolygonMapSymetricDifference
PolygonMapDifference
PolygonMapRelate

New ILWIS 3.7 Polygon Applications

PolygonMapBuffer

The buffer of a Point/Segment/Polygon at a distance r is the Polygon or MultiPolygon which contains all points within a distance d of the feature.

 

Syntax
PolygonMapBuffer(InputMap, BufferDistance,EndCapStyle);

The operation has three parameters:

 Input map
 
Any polygon/point or segment map
 Buffer distance        
 
The distance of the points included. Positive and negative values are supported (dilation & erosion)
 End cap style How the ends of lines are calculated


 

PolygonMapConvexHull

The convex hull of a Point/Segment/Polygon is the smallest convex Polygon that contains all the points in the Point/Segment/Polygon (collection).

 

Syntax
PolygonMapConvexHull(InputMap, isCombined)

Input map Any polygon/point or segment map
 isCombined     
 
Either create the convexhull over all the features or treat every element separately (which, in some case, might not make sense )


 
 

PolygonMapDifference

Calculates the difference between polygons in the two inputmaps. From Each polygon in the first input map the covering polygon(s) from the second input map, if any, is substracted.

(grey and orange lines are the boundaries of the original 2 polygons)

Syntax
PolygonMapDifference(Inputmap1,  Inputmap2)

 Inputmap1     
 
PolygonMap
 Inputmap2  
 
PolygonMap

 

PolygonMapSymetricDifference

Calculates the symmetric difference between polygons in the two inputmaps. From Each polygon in the first input map the symmetric difference with any of the polygons from the secondmap is calculated

Syntax
PolygonMapSymetricDifference(Inputmap1,  Inputmap2) 

 Inputmap1     
 
PolygonMap
 Inputmap2  
 
PolygonMap

 

PolygonMapIntersect

Calculate the intersection of  a polygon of the input map with polygons of the output map. The map will be associated with an attribute table that contains the values of the original maps in a certain polygon.


(grey and orange lines are the boundaries of the original 2 polygons)

Syntax
PolygonMapIntersect((Inputmap1,  Inputmap2)

 Inputmap1     
 
PolygonMap
 Inputmap2  
 
PolygonMa

 

PolygonMapRelate

For each polygon in the first inputmap a Boolean test is done to each feature in the second output map to see if it holds true. If so, the polygon is included in the output map.

The following relations are implemented

Contains
 
returns true if this polygon contains the specified feature (excluding boundary).
 
CoveredBy 
 
returns true if this polygon is covered by the specified feature.
Crosses returns true if this polygon crosses the specified feature. The features have some but not all interior points in common.
Disjoint returns true if this polygon is disjoint to the specified feature. The two features have no point in common.
Equals returns true if this polygon is equal to the specified feature. The two features have at least one point in common and no point of either feature lies in the exterior of the other feature.
Intersects returns true if this polygon intersects the specified feature. The two features have at least one point in common (intersect is the reverse of disjoint).
Overlaps returns true if this polygon overlaps the specified feature. The features have some, but not all points in common. They have the same dimension and the intersection of the interiors of the two features has the same dimension as the features themselves.
Touches returns true if this polygon touches the specified geometry. The features have at least one point in common, but their interiors do not intersect.
 
Within returns true if this polygon is within the specified feature. Every point of this polygon is a point of the other feature and the interiors of the two features have at least one point in common.
 

Example for “contains”; only polygons that contain the pointmap (yellow dots) are shown.

Syntax
PolygonMapRelate(inputmap1, Inputmap2, relation, negation)

 Inputmap1     
 
PolygonMap
 
 Inputmap2 Polygon/Segment or Pointmap
 Relation See table above
 Negation The relation can be negated to give the opposite result(“true”,”false”)

 

PolygonMapUnion

Merges polygons of the first input map with polygons of the  second input map

 

New Segmentmap Applications

The set operations for segments are identical for segmentmaps: SegmentMapIntersect, SegmentMapDifference, SegmentMapSymetricDifference, SegmentMapUnion, SegmentMapRelate. The only difference is that the set operations for segmentmaps can use a polygonmap (if it is not a segmentmap) as second inputmap. In such a case, the operation works on the boundaries of the polygonmap.

 

SegmentMapVoronoi

From a pointmap, it creates the segmentmap that forms the Voronoi map in which all points on the segments have equal distance to the closest points. Note that the “areas” are not closed, because the boundary segment at the edge of the map would, in theory, go on forever.



Syntax
PolygonMapRelate(Input Pointmap, minimal distance)

Input  pointmap    
 
The input map used to calculate the voronoi boundaries.
Minimal distance The smallest distance which is used to calculate the boundaries. Points with a distance smaller than the minimum are not used in the calculation in relation to each other.

 

SegmentMapTIN

Creates an irregular triangulated network from a input pointmap. This is a ‘bare bones’ implementation of a TIN and only deals with the creation of the segment map. Optionally it can choose to use conves hulls for elements at the edge of the TIN to create a better area filling.



Syntax
SegmentMapTIN(Input pointmap, use Convex hull)

 Input pointmap     
 
The input map used to calculate the TIN
 Use convex hull “True” or “False”. Determines if the TIN will cover the area defined by the convxhull of all the points in the input set.

 

New Pointmap Applications

The set operations for pointmaps are identical for segmentmaps: PointMapIntersect, PointMapDifference, PointMapMapSymetricDifference, PointMapMapUnion, PointMapMapRelate. The only difference is pointmap intersect accepts Pointmaps, Segmentmaps or Polygonmaps as input. It will use the intersection of segments and boundaries to determine the intersection points.

 

PointMapPointInSegment

A convenience application that determines a suitable point in a segment to determine its “middle”. This can be a real centroid, an existing vertex that is the best estimate or a point on of the edges that is closest to the centroid.

The three options in one map. Triangle=Centroid, Circle=Vertex, Diamond=MiddlePoint.

Syntax
PointMapPointInSegment(input segment map, option)

 Input pointmap    
 
The input segment map
 Option The option can be “Centroid”,”Vertex”  or “MiddlePoint”.
 



 
 

 

 

NATURE WORLDWIDE is the official website of the World Institute for Conservation and Environment, WICE. It is an integrated network of web sites dealing with different topics on nature, nature conservation and natural resources management. Read here why we created Nature Worldwide. Our Methodology explains how we produced our information. Our Site Map helps you find your way in the website. We made this website out of passion for conservation. We spent our own salaries and free time to gather the information and publish it on these websites, in total valuing hundreds of thousands of dollars of professional time. Nobody pays us to do this. We simply want to contribute to conservation. If you appreciate our work, PLEASE visit our site Adopt A Ranger and see how you can make a difference for conservation most effectively: By paying one day of the salary of a ranger, you will make a difference in conserving the lives of thousands of birds, other critters and entire forests. Check our sitemap. Enjoy!

NATURE DU MONDE est le site Web officiel du World Institute for Conservation and Environment, WICE, C'est une collection intégrée de sites web qui traitent avec des sujets différents sur nature, conservation de la nature et gestion des ressources naturelles. Lisez ici pourquoi nous avons créé Nature de Monde. Notre Methodologie explique comme nous avons produit nos renseignements. Notre Site Map vous aide trouver votre entrée dans le site web. Beaucoup de plaisir!

NATURALEZA DEL MUNDO es la página Web oficial del World Institute for Conservation and Environment, WICE, Es una red de páginas Web tratando de temas diferentes relacionados a la naturaleza, la conservación el manejo de recursos naturales, parques nacionales y áreas protegidas. Lea aqui porqué hicimos Naturaleza del Mundo. Nuestra Methodología explica como produjimos la información. Nuestro Mapa del sitio le ayuda encontrar su información en nuestra página web. Disfrute! 

NATUREZA DO MUNDO é o Web site oficial do World Institute for Conservation and Environment, WICE, Es uma red de páginas Web tratando de temas diferentes relacionados à natureza, la conservação el manejo de recursos naturaleiss, parques nacionais y áreas protegidas. Lea aqui porqué creamos Natureza do Mundo. Nossa Methodología explica como produjimos a informação. Nosso Mapa do sitio le ayuda encontrar sua informação no web site. Desfrute!

NATUR DER GANZEN WELT ist, die offiziellen Website der World Institute for Conservation and Environment, WICE. Es ist ein einheitliches Netzwerk von Web Sites, über Themen wie Natur, Natur-Schutz und natürlichem Ressourcen Quellen Hege. Lesen Sie hier warum wir Natur der ganzen Welt gemacht haben. Un

sere Verfahrensweise erklärt, wie wir unsere Informationen produziert würde. Unsere Site Map  hilft Ihnen Ihren Weg im Website zu finden. Viel Spaß!

NATUUR UIT ALLE STREKEN is, de officiële Website van het World Institute for Conservation and Environment, WICE. Het is een geïntegreerd Netwerk van websites, over Natuur, Natuurbescherming en het beheer van natuurlijke hulpbronnen. Lesen Sie hier warum wir Natuur uit alle Streken gemacht haben. Onze pagina Methode legt uit, hoe we onze informatie vergaarden. Onze Site Map helpt u op weg door onze website. 

WICE is a worldwide non-government non-profit organization that contributes to the conservation of nature. While it works on a many issues related to the conservation of nature and the protection of the environment, it is particularly committed to the conservation of national parks and other protected areas.

  Please read the disclaimer