Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Geometry --- Géométrie --- Data processing. --- Informatique --- Data processing --- 514.16 --- -681.3*F22 --- 681.3*I35 --- Mathematics --- Euclid's Elements --- Geometries over algebras --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Computational geometry and object modeling (Computer graphics) --- 681.3*I35 Computational geometry and object modeling (Computer graphics) --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 514.16 Geometries over algebras --- Géométrie --- EPUB-LIV-FT LIVINFOR SPRINGER-B --- 681.3*F22
Choose an application
This volume constitutes the refereed proceedings of the 19th International Symposium on Graph Drawing, GD 2010, held in Eindhoven, The Netherlands, during September 2011. The 34 revised full papers presented together with 3 revised short and 6 poster papers were carefully reviewed and selected from 88 submissions. Furthermore, the proceedings contain the abstracts of two invited talks and to commemorate Kozo Sugiyama and his pioneering research in graph drawing, the proceedings include an obituary. A unique and fun part of the symposium is the Graph Drawing Contest, which is part of the Graph Drawing Challenge. This year was the 18th edition. A report on the contest is included at the end of the proceedings.
Engineering & Applied Sciences --- Computer Science --- Technology - General --- Computer graphics --- Graph theory --- Data processing --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Computer science. --- Algorithms. --- Computer science --- Computers. --- User interfaces (Computer systems). --- Computer Science. --- Discrete Mathematics in Computer Science. --- Math Applications in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Models and Principles. --- Symbolic and Algebraic Manipulation. --- User Interfaces and Human Computer Interaction. --- Mathematics. --- Interfaces, User (Computer systems) --- Human-machine systems --- Human-computer interaction --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Algorism --- Algebra --- Arithmetic --- Informatics --- Science --- Mathematics --- Foundations --- Combinatorial analysis --- Topology --- Computational complexity. --- Computer software. --- Data processing. --- Software, Computer --- Complexity, Computational --- Computer science—Mathematics. --- Discrete mathematics. --- Human-computer interaction. --- Mathematical Applications in Computer Science. --- Models of Computation. --- Computer-human interaction --- Human factors in computing systems --- Interaction, Human-computer --- Human engineering --- User-centered system design --- User interfaces (Computer systems) --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Choose an application
Computational geometry emerged from the field of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains - computer graphics, geographic information systems (GIS), robotics, and others - in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study.
Artificial intelligence. Robotics. Simulation. Graphics --- complexe analyse (wiskunde) --- grafische vormgeving --- informatica --- systeemtheorie --- wiskunde --- KI (kunstmatige intelligentie) --- geologie --- geometrie --- informatietheorie --- Computers. --- Geometry. --- Computer science --- Earth sciences. --- Computer graphics. --- Algorithms. --- Theory of Computation. --- Math Applications in Computer Science. --- Earth Sciences, general. --- Computer Graphics. --- Algorithm Analysis and Problem Complexity. --- Mathematics. --- Algorism --- Algebra --- Arithmetic --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Geosciences --- Environmental sciences --- Physical sciences --- Computer mathematics --- Mathematics --- Euclid's Elements --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Foundations --- Digital techniques
Choose an application
Listing 1 - 4 of 4 |
Sort by
|