Manifold System ships with numerous solvers, more than any other GIS system at almost any price. In addition to standard solvers, shown in bold face black text below, Manifold includes a system for adding solver packages and other capabilities to the system. manifold.net has released various solvers for free download (shown in bold face purple text below) that may be downloaded and added to 4.50 by any licensed Manifold user. In addition, manifold.net sells at additional cost three solver packages (3D View Studio, Business Tools 2 and Topology Factory) that install solvers shown in bold face blue text below. Click on the headings below to jump directly to that section.
| Utility Programs | These programs are Windows utilities provided with Manifold System. Note that Manifold System includes embedded importers for SDTS, DLG, VPF, TIGER/Line 95, TIGER/Line 97, TIGER/Line 98, ESRI .EOO, ESRI .SHP, MapInfo MID/MIF, AutoCad DXF, MDB/ODBC import, and a variety of text and network importers. |
| DEM to Manifold Converter | Converts USGS DEM or gtopo30 DEM files (Digital Elevation Module) terrain elevation data files to Manifold Maps. SP2 upgrades to include NOAA GLOBE format. |
| Manifold Exporter | Exports Manifold format maps to AutoCAD .dxf, MapInfo .mid/.mif and ESRI .shp formats. |
| World View | 3D schematic globe. May be called from within Manifold to show global location of current map workspace or called independently as a desktop toy. SP2 upgrades with elevation or political map textures. |
| Quick Look | Provides a high speed browser for viewing individual files or entire directories of Manifold maps. |
| TTF to Icon Converter | Converts True Type Fonts (symbols or ordinary characters) into Windows icon files so that symbols from True Type Fonts may be used as map icons. Assists migration from older systems such as MapInfo that utilize TTF symbols as map icons instead of true Windows icons. |
| TAIF Converter | TeleAtlas is a premium supplier of European and other international cartographic digital data. Converts TeleAtlas Interchange Format into Manifold format. |
| NTAD 99 Converter | Convert the spectacular maps and GIS data sets on the free NTAD 99 CD issued by the Bureau of Transportation Statistics. |
| Ordnance Survey NTF Converter | Convert UK Ordnance Survey LandLine and LandLine Plus maps in NTF format into Manifold format. |
Solvers
| 3D View | Solver heading installed by 3D View Studio Solver Package (extra cost option). |
| 3D View Studio | Launch 3D View Studio |
| 3D View Studio (Points Only) | Launch with fast algorithms for point data. |
| 3D View Studio (Multiple Surfaces) | Launch with multiple Z fields for multiple surfaces. |
| 3D View Studio Import | Import 3D objects into 3D View |
| Business | Solver heading installed by Business Tools 2 Solver Package (extra cost option). |
| Territory Balancing | Assign map objects into territories by weighted contents of a data field. |
| Drive Time Analysis | Create drive time polygons |
| Optimal Route | Find best route through the map |
| Closest Facilities | Find closest facilities to specified facilities |
| Send Email | Send email or page a pager from Manifold. Formerly free download solver moved into Business Tools 2 Solver package. |
| Decision Support System | Use "Fuzzy Logic" to make database selections with queries incorporating profiles and hedges. |
Remember, solvers in Black come with the system for $145 and solvers in Purple are free downloads.
| Topology | Boolean operations and other advanced solvers. |
| Area Compress | Repair redundant or phantom metrics. |
| Area Intersection | Create area that is the intersection of areas. |
| Area Non Intersecting | Create area that is region not intersected by another area. |
| Area Subtraction | Create a new area by subtracting one area from another. |
| Area Union | Combine two areas into one area. |
| Topology Factory | Launch Topology Factory Console. Solver installed by Topology Factory Solver Package (extra cost option). |
| Clip Inside | Use one area as a "cookie cutter" to clip those parts of objects found within it. Installed by Topology Plus solver package (free download). |
| Clip Outside | Use one area as a "cookie cutter" to clip those parts of objects not found within it. Installed by Topology Plus solver package (free download). |
| Split Objects | Use one area as a "cookie cutter" to split into more than one object those objects that intersect its boundary. Installed by Topology Plus solver package (free download). |
| Geometry | Simple geometric computations |
|
Measurement |
|
| Areas | Compute areas of polygons |
| Lengths | Compute lengths of lines |
| Perimeters | Compute lengths of area perimeters |
| Distance between Two Sets | Find Distance between two collections of map objects (i.e., theme to theme, set to set, layer to layer, etc) |
| Extremal Coordinates | Largest and smallest coordinates in the object set. |
|
General |
|
| Bounding Rectangle | Draw minimum rectangle that encloses specified objects |
| Common Centroid | Create the centroid for the specified objects |
| Centroids | For each object create a centroid by center of mass or other method |
| Convex Hull | Create the minimum polygonal figure that encloses the specified objects |
| Nearest Pair | Find the nearest two objects in the specified set. |
| Farthest Pair | Find the farthest two objects in the specified set. |
| Nearest Neighbors | Give a pair-wise comparison between two sets, a source and a target set, find the nearest pair of objects where each is in a different set. |
| Farthest Neighbors | Give a pair-wise comparison between two sets, a source and a target set, find the farthest pair of objects where each is in a different set. |
| Symmetric Nearest Neighbors | Find the nearest neighbors when the result is the same regardless of which set is considered the source or target set. |
| Symmetric Farthest Neighbors | Find the farthest neighbors when the result is the same regardless of which set is considered the source or target set. |
| Star Polygonization | Like the convex hull, but "sucked into" a target inner point. |
| Delaunay Triangulation | Build a Delaunay Triangulation on the selected objects. |
| Delaunay Triangulation (Points Only) | Build a Delaunay Triangulation on the selected objects: an especially fast algorithm used when all objects are points. |
| Select Points by Threshold | "Thins" a data set by choosing only those points that are different from their neighbors by a specified threshold value. Essential for thinning data when creating contour maps or visualizing large fields of data in 3D View Studio. |
| Select Significant Points | "Thins" a data set by choosing points that comprise a specified percentage of the "most significant" points using a global/local comparative algorithm. Essential for thinning data when creating contour maps or visualizing large fields of data in 3D View Studio. |
| Spatial Analysis | "Spatial" capabilities usually found only in systems costing thousands of dollars. |
|
Spatial Correlations |
Spatial statistics functions. |
| Auto-Correlation Along Horizontal Line | Find the auto-correlation between a formula [data field or Active X formula based on a data field] and spatial distance along a horizontal line. |
| Auto-Correlation Along Vertical Line | Find the auto-correlation between a formula [data field or Active X formula based on a data field] and spatial distance along a vertical line. |
| Auto-Correlation Along Diagonal Line | Find the auto-correlation between a formula [data field or Active X formula based on a data field] and spatial distance along a diagonal line. |
| Cross-Correlation Along Horizontal Line | Find the cross-correlation between two formulas [data fields or Active X formulas based on data fields] and spatial distance along a horizontal line. |
| Cross-Correlation Along Vertical Line | Find the cross-correlation between two formulas [data fields or Active X formulas based on data fields] and spatial distance along a vertical line. |
| Cross-Correlation Along Diagonal Line | Find the cross-correlation between a between two formulas [data fields or Active X formulas based on data fields] and spatial distance along a diagonal line. |
|
General |
|
| Interpolate Point Values | Use Delaunay / Akima Interpolation to find values for a given field for objects that do not have them. |
| Single Value Contour | Create a single contour line from values in a data attribute. |
| Contour Stack | Create a set of contour lines for multiple values at once. |
| Buffer Zone | Create a buffer zone for an object. |
| Buffer Zone (Points Only) | Create a buffer zone using a fast, points-only algorithm. |
| Common Buffer Zone | Create a common buffer zone for multiple objects at once. |
| Common Buffer Zone (Points Only) | Create a common buffer zone using a fast algorithm when all objects are points. |
| Common Buffer Zone Stack | Create several buffer zones for multiple distances at once for multiple objects at once. |
| Common Buffer Zone Stack (Points Only) | Create several buffer zones for multiple distances at once for multiple objects at once using a fast algorithm when all the objects are points. |
| Reachable Zone | Create a zone reachable through a network in given distance or ActiveX formula from a given start point. |
| Reachable Zone Stack | Create multiple zones at once reachable through a network using multiple given distances or ActiveX formulas from a given start point. |
| Voronoi Cell | Create a Voronoi (Thiessin) polygon for one object. |
| Voronoi Diagram | Use specified objects to create multiple Voronoi polygons to tile the specified region. |
| Approximate Voronoi Cell | Voronoi Cell using very fast, approximate algorithm. |
| Approximate Voronoi Diagram | Voronoi tiling using very fast, approximate algorithm. |
| Contour Map | Automatically create area polygons for various intervals of data attribute or formula values. Create areas in a variety of ways. |
| Dissolve | "Dissolve" boundaries between area polygons to create new polygons where areas share common data attribute values as specified. Allows sophisticated "polygon-in-polygon" data attribute inheritance/copying to new areas. |
| Statistics | Solvers that perform various statistical computations. |
|
Frequencies |
|
| One-way Frequency | Frequency count (histogram) of one data attribute within intervals. |
| One-way Frequency within Bounds | Frequency count (histogram) of one data attribute within given upper and lower bounding values. |
| One-way Frequency using Classes | Frequency count (histogram) of one data attribute using specified classes. |
| One-way Frequency using Cutpoints | Frequency count (histogram) of one data attribute with each interval specified by upper and lower cutpoints. |
| Two-way Frequency | Frequency count (histogram) of two data attributes within intervals. |
| Two-way Frequency within Bounds | Frequency count (histogram) of two data attributes within given upper and lower bounding values. |
| Two-way Frequency using Classes | Frequency count (histogram) of two data attributes using specified classes. |
| Two-way Frequency using Cutpoints | Frequency count (histogram) of two data attributes with each interval specified by upper and lower cutpoints. |
|
Regressions |
|
| Least Squares Line | Compute a least squares fitted line to a data attribute. |
| Least Abs Values Line | Compute a least absolute values fitted line to a data attribute. |
| Least Max Value Line | Compute a least maximum value fitted line to a data attribute. |
| All Linear Regressions | Compute all three regression types for fitted lines to a data attribute. |
|
General |
|
| Sum and Range | Report sum and total range of a given attribute. |
| Mean Value | Report mean value of a given attribute. |
| Variance | Report Variance of a given attribute. |
| Standard Deviation | Report Standard Deviation of a given attribute. |
| Skewness | Report skewness of a given attribute. |
| Excess | Report excess (kurtosis) of a given attribute. |
| Percentage | Computes sum of the values for a given attribute and then reports what percentage of that sum each particular record's value represents. |
| Top Values | Report N largest values of a given attribute. |
| Bottom Values | Report N smallest values of a given attribute. |
| Typical Values | Computes average value, and then reports the N values that are closest to that average value. |
| Exceptional Values | Computes average value, and then reports the N values that are farthest to that average value. |
| Covariances | Report covariance between N different fields. |
| Correlations | Report correlation between N different fields. |
| Simple Statistics | Report a collection of common statistics on a given field. |
| Utility Solvers | Miscellaneous solvers used to edit maps, create objects, perform specialty import/export and so forth. |
|
General |
|
| Output Selection | Output selection to Results History |
| Output Selection Points | Output points/inflection points of selection to Results History |
| Output Selection First Points | Output only the first points/inflection points of selection to Results History |
| Save Layered Map | Save map with fixed layer structure. |
| Save Selection as DXF | Save map as AutoCAD .dxf format file. |
| Save Selection as Map | Save the selection as a new Manifold map. |
| Save Selection as Map with Abstract Coords | Save the selection using any two numeric fields as abstract X,Y (CAD style) coordinates. |
| Change Selection Direction | Change the direction variable for all objects (used with directed networks) |
| Set Closure | Include points so that all lines in the specified set have points at their ends. |
| Selection Closure | Include points so that all lines in the selection have points at their ends. |
| Find Empties | Find records with empty values in given data attributes (multiple attributes OK). Installed by find_dups.mxz solver package (free download). |
| Find Duplicates | Find records with duplicated values in given data attributes (multiple attributes OK). Installed by find_dups.mxz solver package (free download). |
| Save Set as Bitmap | Save the map rectangle bounding the specified set (normally, a layer, the entire map, current map view, etc) to a graphics image bitmap. Intended for use in creating presentation graphics and "draping" maps over 3D surfaces in 3D View Studio. |
| Save Selection as Bitmap | Save the map rectangle bounding the Selection to a graphics image bitmap. Intended for use in creating presentation graphics and "draping" maps over 3D surfaces in 3D View Studio. |
| Graticule | Windows dialog-driven cartographic graticule generator. Automatically create graticules as any combination of lines, points or even areas for any projection. |
|
Export/Import |
|
| Write MDB Database | Export as Access format database. |
| Read MDB Database | Import from Access format database. |
| Write MDB Database (Points Only) | Export points-only set of objects as really simple Access format database. |
| Read MDB Database (Points Only) | Read simple Access format database as a points-only object set. |
| Write Text File | Save objects as simple text format file. |
| Read Text File | Read objects from simple text format file. |
| Read Random Coords | Read objects from Access database and import assigning random XY or Lat/Lon coords. Installed by read_random.mxz solver package (free download). |
|
GPS Tools |
|
| GPS Setup | Setup up GPS device, port, units conversion, etc. |
| GPS Current Position | Fetch current position from the GPS, including data attributes if desired. |
| GPS Import | Import stored waypoints or routes from GPS, including data attributes if desired. |
|
Make Objects |
(All objects may be created as points, lines, areas or any combination thereof.) |
| Make Circle | Create a circle of given size and location. |
| Make Circle Stack | Create several nested circles at once using specified sizes. |
| Make Areas from NonIntersecting Lines | Create an area from enclosing lines. |
| Make Areas from Self-Loops | Create an area from a self-loop (line that ends at its own beginning). |
| Make Area Boundaries | Create a line object that follows the edge of an area. |
| Make Inflection Points | Create Point objects at the inflection points of lines or areas. |
| Make Line from Point Set | Create a line from a point set using a data attribute or a formula as a guide for the order in which points are assembled into the line's inflection points. Installed by make_line.mxz solver package (free download). |
| Make Bezier from Point Set | Create a curved line using Bezier curves from a point set using a data attribute or a formula as a guide for the order in which points are assembled into the line's inflection points. (free download). |
|
Network Import / Export |
|
| Read Network | Read a network from a simple text format file. |
| Read Network Using Commas | Read a network from a comma separated value text format file. |
| Read Weighted Network | Read a weighted network from a simple text format file. |
| Write Network | Write a network to a simple text format file. |
| A huge array of solvers used in network analysis such as transportation or communications network analysis. | |
|
Building Networks |
|
| Complete Network | Create links between all given nodes. |
| Clusters Network | Create network links between nodes near to each other in clusters. |
| Gabriel Network | Create links to form a Gabriel graph on the given nodes. |
| Relative Neighborhood Network | Create network links between nodes in the same relative neighborhood. |
| Greedy Triangulation | Create links between points to form a "greedy" (no steps back algorithm) triangulation. |
|
Finding Centers |
|
| Emergency Centers | Given a network, find optimal places to put emergency service centers. Works with any formula, not just distance or distance field. (Exact graph theoretic solution.) |
| Regular Centers | Given a network, find optimal places to put regular service centers. Works with any formula, not just distance or distance field. (Exact graph theoretic solution.) |
| Fast Emergency Centers | Emergency centers using fast, approximate algorithm. |
| Fast Regular Centers | Regular centers using a fast, approximate algorithm. |
|
Routing |
|
| Spanning Tree | Find a minimum spanning tree through the given network. |
| Path through All Links | Find a path through all the links in a network that goes over each link but once. (Euler chain) |
| Loop through All Links | Find a path through all the links in a network that goes over each link but once and ends where it started. (Euler cycle) |
| Loop through All Nodes | Find a path through all the nodes in a network. (Hamiltonian cycle) |
| Shortest Loop | Find the shortest loop (may be more than one) in the network by hyperlinks. |
| Fixed-Length Loop | Find a loop of given number of hyperlinks (may be more than one) in the network. |
| Steiner Tree | Find a spanning tree for the given subset of points. |
| Classic Salesman Route | Find the best route by data attribute (distance, etc) or ActiveX formula through all the nodes in a given network without repeating any node. |
| Classic Postman Route | Find the best route by data attribute (distance, etc) or ActiveX formula through all the links in a given network without repeating any link. |
| Partial Salesman Route | Find the best route by data attribute (distance, etc) or ActiveX formula through the given subset of nodes in a given network without repeating any node. |
| Partial Postman Route | Find the best route by data attribute (distance, etc) or ActiveX formula through the given subset of links in a given network without repeating any link. |
| Multiple Salesman Routes | Find the best routes by data attribute (distance, etc) or ActiveX formula through all the nodes in a given network without repeating any node, when using multiple agents. |
| Multiple Postman Routes | Find the best routes by data attribute (distance, etc) or ActiveX formula through all the links in a given network without repeating any links, when using multiple agents. |
|
Network Structure |
|
| Connected Subnets | Find the maximum connected subnetworks that comprise the given network. |
| Network Clusters | For the given network, if possible find a set of subnetworks (clusters) such that each cluster is a connected subnet and that each cluster has the same sum of node values for the given attribute. |
| Planarity | Report if the network is planar (can be laid out flat without intersections) or not. |
| Metric Properties | Report the radius (minimal eccentricity) and diameter (maximal eccentricity) of a given network. |
| Psuedo Diameter | Utilize the Gibbs, Pool and Stockmyer method with Garifulin's modification to compute the approximate diameter of a given network. |
| Maximum Matching | Find the largest matching in the network (that is the largest set where any two links in the set are not adjacent). |
| Node Degrees | The number of links incident to a given node. |
| Node InDegrees | In a directed network, the number of links coming in to a node. |
| Node OutDegrees | In a directed network, the number of links going out from a node. |
| Leaves | In a given network, finds any induced connected subnetworks with no critical links which are not part of any larger subnetwork with identical features. |
| Blocks | Finds any subnetworks with no critical nodes. |
| Node Colors | Color the nodes in the network (by assigning them to sets) such that a minimum number of colors are used. |
| Link Colors | Color the links in the network (by assigning them to sets) such that a minimum number of colors are used. |
| Dominance Set | Given a network and a subset of nodes in the network, the minimum set of nodes that must be added to the given subset so that the subnetwork thus created is connected. |
| Adjacent Nodes | Find all nodes that are connected to the given node by exactly one link. |
| Adjacent Links | Report all links that have a node in common with this link. |
| Incident Nodes | Find the nodes at the ends of this link. |
| Incident Links | Find all links that have one end at this node. |
| Loop Base | Find the loop base for the given network; the basis of the loop space subspace in the subnetwork space that is the linear vector space taken from the set of all spanning subnetworks of a fixed undirected network. |
| Cutset Base | Find the cutset base; the basis of the cutset (simple network cutset) space subspace in the subnetwork space that is the linear vector space taken from the set of all spanning subnetworks of a fixed undirected network. |
| Cross-Free Decomposition | Heuristic, approximate (but very good) splitting of the given network into paths such that every link in the network is part of a path and no node in the path except end points is a part of any other path. The paths do not cross each other. |
| Kernel Nodes | Find all nodes in the network's kernel (minimal eccentricity). |
| Peripheral Nodes | Find all nodes in the network's periphery (maximal eccentricity). |
| Eccentricities | For each node in a given network, calculates the eccentricity of the node. |
|
General |
|
| Connectivity | Reports if a network is connected or not. |
| Unattached Nodes | Finds all nodes not connected to the network. |
| Unattached Links | Finds all links not connected to the network. |
| Self-Loops | Finds all links that start and end at the same node. |
| Loops | Finds and reports the first path found that starts and ends at the same node. |
| Critical Nodes | Finds those nodes which if deleted along with any incident links would disconnect the network. |
| Critical Links | Finds those links which if deleted would disconnect the network. |
| Reachable Nodes | Finds those nodes reachable from a given node in a given distance, where distance can be any computed or abstract (hyperlink) distance or formula. |
| Minimum Node Cutset | The minimum number of nodes that must be deleted to disconnect the network. |
| Minimum Link Cutset | The minimum number of linkss that must be deleted to disconnect the network. |
| Shortest Path | The shortest path by any field or computed formula or abstract measure (hyperlinks) as desired from one node to another. |
| MiniMax Path | The path from one node to another which overall minimizes the occurrence, even once, of the highest value attained for a given field. |
| Maximum Flow | Maximum flow through a directed network between two given nodes using specified data field or ActiveX formula. Uses Dijkstra and Jen algorithms. |
| Scripting Tutorial Example Solvers | Visual Basic Scripting source code for all scripting tutorial examples pre-loaded into the solver menu tree to facilitate "following along" with the online scripting tutorial. |
| Selecting Map Lines (scan) | Select all the lines in a map using an obvious, but inefficient method. |
| Selecting Map Lines (LinesOf) | Select all the lines in a map using the LinesOf() built-in function. |
| Selecting Map Lines (SQL) | Select all the lines in a map using extended SQL. |
| Selecting Map Lines (dialog) | Select all the lines in a map using an interactive dialog with a filter. |
| Selection Size in Bytes | Count up the total size in bytes of objects in the Selection. |
| Branched Objects in Selection | Traverse the selection and find all objects that are topologically branched. |
| Objects in Current Map | Get all the objects in each layer of the current map and write the number of each to Results History. |
| Even and Odd Field Values | Field manipulation: count the number of even and odd values in a field. |
| Soundex Scan | Find all text values that should like the given string using Bell Labs "Soundex" algorithm. |
| Results History Formatting | Prettify results sent to Results History. |
| Object Size Counter | Save the size of each object as an associated value/handle in the Results History output. |
| Field Animation | Animate objects by their field values. (Teaches animation). |
| Left-Top Corner | Dialogs and SQL: use SQL to find the top-left corner of a selection. |
| Formulas | Pop open a dialog to ask for an ActiveX formula and compute it on a given set of objects. |
| Cascaded Dialogs | Example of opening dialogs from other dialogs. |
| Formula Statistics | Calling statistics solvers with ActiveX formulas. |
| Feeding Data to Microsoft Excel | Launch Excel from within a solver script and send table data to the active worksheet. |
| Spell-Check Geographic Names using MapPoint | Launch Microsoft MapPoint as an automation server and use it to spell check geographic names in Manifold. |
| Map Dimensions | Geometric computations: compute the dimensions of the current map. |
| Bounding Boxes | Create bounding box that inherits data fields. |
| Replace Map Measurement Units | Change the internal measurement units of a map. |
| Objects Near Location | Simple measurement of objects within given radius. |
| Formula Graphs | Create plots of formulas within a Results History Histogram plotting system. |
| Pass-Through Points | Use network NodeDegree function to find all pass-through points in a network. |
| Simple Drive Time Zones | Given a network, driving origin and driving distance find simple reachable zone using a mix of network and geometry functions. |
| Orienting the Net | Apply directionality to an unoriented network. |
| File-Based SQL | Read an SQL string form a file, execute it on the current map and then append the results to a log file. Illustrates file access methods. |
A Steal at Twice the Price! - Manifold System Release 4.50 is priced at only $145: that's the best deal ever in GIS! Check out the Web version of the 4.50 user manual for a comprehensive list of capabilities and improvements.
Call 800-556-5919 today to order your copy of
Release 4.50, or teleport right away to the Manifold.net
Online Store to buy a copy right now!
|
Home Page -
Products -
Search -
Support -
Shopping -
News -
Online Store Prices, terms and conditions, and product specifications subject to change without notice. Please contact Manifold Net with any special needs or requests. |