CodeCentral Submissions for Sven Thielhttp://codecentral.embarcadero.com/Generated by Atom.NET2020-06-04T10:48:30-07:00AlgoCOMsDiagram 1.02Sven Thielhttp://codecentral.embarcadero.com/Item/235172005-08-19T09:28:35-07:002005-08-19T09:28:35-07:00AlgoCOMsDiagram draws pictures of data and its relationships, diagrams of networks, organigrams, biopathways or whatsoever.AlgoCOMsDiagram is a COM-object which provides access to many layout algorithms for planar and non-planar networks. A network represents data and its relationships. An example would be a work-flow diagram, which models different different tasks and the precedence relation between them. AlgoCOMsDiagram layouts the networks such that certain aesthetic criteria are fullfilled. Thus it generates a visual representation of abstract data which can be easily consumed by human users.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsDiagram 1.01Sven Thielhttp://codecentral.embarcadero.com/Item/220482005-08-19T08:02:57-07:002005-08-19T08:02:57-07:00AlgoCOMsDiagram draws pictures of data and its relationships, diagrams of networks, organigrams, biopathways or whatsoever.AlgoCOMsDiagram is a COM-object which provides access to many layout algorithms for planar and non-planar networks. A network represents data and its relationships. An example would be a work-flow diagram, which models different different tasks and the precedence relation between them. AlgoCOMsDiagram layouts the networks such that certain aesthetic criteria are fullfilled. Thus it generates a visual representation of abstract data which can be easily consumed by human users.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsPolygon 1.1Sven Thielhttp://codecentral.embarcadero.com/Item/224802004-10-07T01:20:43-07:002004-10-07T01:20:43-07:00AlgoCOMsPolygon provides boolean operations on general polygons (with holes) and easily overcomes problems due to finite precision arithmetic.AlgoCOMsPolygon is a COM-object which provides operations on general polygons, i.e. polygons that may contain holes. The operations include bolean operations (union, intersection, diference, symmetric difference), area computation and others. For the internal computations exact arithmetic is used so that no rounding errors can occur.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsDiagram 1.01Sven Thielhttp://codecentral.embarcadero.com/Item/224822004-10-07T01:01:51-07:002004-10-07T01:01:51-07:00AlgoCOMsDiagram draws pictures of data and its relationships, diagrams of networks, organigrams, biopathways or whatsoever.AlgoCOMsDiagram is a COM-object which provides access to many layout algorithms for planar and non-planar networks. A network represents data and its relationships. An example would be a work-flow diagram, which models different different tasks and the precedence relation between them. AlgoCOMsDiagram layouts the networks such that certain aesthetic criteria are fullfilled. Thus it generates a visual representation of abstract data which can be easily consumed by human users.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsNetwork 1.0Sven Thielhttp://codecentral.embarcadero.com/Item/224602004-10-06T00:47:38-07:002004-10-06T00:47:38-07:00AlgoCOMsNetwork provides many graph and network algorithms including methods like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others.AlgoCOMsNetwork is a COM-object which provides many graph and network algorithms like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others. The algorithms are highly efficient and can be applied to large scale networks.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsNetworkSven Thielhttp://codecentral.embarcadero.com/Item/224592004-10-04T06:50:27-07:002004-10-04T06:50:27-07:00AlgoCOMsNetwork provides many graph and network algorithms including methods like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others.AlgoCOMsNetwork is a COM-object which provides many graph and network algorithms like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others. The algorithms are highly efficient and can be applied to large scale networks.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsDiagram 1.01Sven Thielhttp://codecentral.embarcadero.com/Item/183982004-01-09T01:50:33-08:002004-01-09T01:50:33-08:00AlgoCOMsDiagram helps you to draw nice pictures of network diagrams, organigrams, biopathways or any other data and its relationships by computing attractive layouts.AlgoCOMsDiagram is a COM-object which provides access to many layout algorithms for planar and non-planar networks. A network represents data and its relationships. An example would be a work-flow diagram, which models different different tasks and the precedence relation between them. AlgoCOMsDiagram layouts the networks such that certain aesthetic criteria are fullfilled. Thus it generates a visual representation of abstract data which can be easily consumed by human users.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsPolygon 1.0Sven Thielhttp://codecentral.embarcadero.com/Item/184002003-09-19T07:29:16-07:002003-09-19T07:29:16-07:00AlgoCOMsPolygon provides boolean operations on general polygons (with holes) and easily overcomes problems due to finite precision arithmetic.AlgoCOMsPolygon is a COM-object which provides operations on general polygons, i.e. polygons that may contain holes. The operations include bolean operations (union, intersection, diference, symmetric difference), area computation and others. For the internal computations exact arithmetic is used so that no rounding errors can occur.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsNetwork 1.0Sven Thielhttp://codecentral.embarcadero.com/Item/183992003-09-19T07:23:25-07:002003-09-19T07:23:25-07:00AlgoCOMsNetwork provides many graph and network algorithms including methods like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others.AlgoCOMsNetwork is a COM-object which provides many graph and network algorithms like shortest path, min-cost-max-flow, maximum weighted matchings, embedding, and others. The algorithms are highly efficient and can be applied to large scale networks.We provide a trial version which can be tested for 30 days after its first installation.AlgoCOMsDiagram 1.01Sven Thielhttp://codecentral.embarcadero.com/Item/206092003-09-17T05:29:17-07:002003-09-17T05:29:17-07:00AlgoCOMsDiagram helps you to draw nice pictures of network diagrams, organigrams, biopathways or any other data and its relationships by computing attractive layouts.AlgoCOMsDiagram is a COM-object which provides access to many layout algorithms for planar and non-planar networks. A network represents data and its relationships. An example would be a work-flow diagram, which models different different tasks and the precedence relation between them. AlgoCOMsDiagram layouts the networks such that certain aesthetic criteria are fullfilled. Thus it generates a visual representation of abstract data which can be easily consumed by human users.We provide a trial version which can be tested for 30 days after its first installation.