scientific article; zbMATH DE number 1368469

Publication date: 24 November 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Robustness and Randomness, On a routing and scheduling problem concerning multiple edge traversals in graphs, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, Computing orthogonal drawings with the minimum number of bends, Unnamed Item, Probabilistic Data Propagation in Wireless Sensor Networks, Dynamic Matching Algorithms in Practice, The point of polygon problem for arbitrary polygons, Classification of robust cycle bases and relations to fundamental cycle bases, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Polygon decomposition for efficient construction of Minkowski sums, On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation, Approximation algorithms in combinatorial scientific computing, Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks, Spin glasses: a computational challenge for the 21st century, Balancing sparse Hamiltonian eigenproblems, Trading uninitialized space for time, A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks, A generalization of the scaling max-flow algorithm, An analysis of the highest-level selection rule in the preflow-push max-flow algorithm, An adaptable and extensible geometry kernel, Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments, A package for exact kinetic data structures and sweepline algorithms, Gallai-Edmonds decomposition as a pruning technique, Short trees in polygons, Efficient Predicate Evaluation Using Randomized Degeneracy Detection, Computing all efficient solutions of the biobjective minimum spanning tree problem, Creating a consensus ranking of proposals from reviewers' partial ordinal rankings, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, The infection time of graphs, A separation bound for real algebraic expressions, Experiments on data reduction for optimal domination in networks, A polynomial algorithm for the multicriteria cent-dian location problem, GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance, Attributed relational graph matching based on the nested assignment structure, An intersection-sensitive algorithm for snap rounding, Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks, Programming with C++ concepts, The weak-heap data structure: variants and applications, ISB-tree: A new indexing scheme with efficient expected behaviour, Shortest path and maximum flow problems in networks with additive losses and gains, ILIGRA: an efficient inverse line graph algorithm, A Linear Kernel for Planar Feedback Vertex Set, Practical algorithms for branch-decompositions of planar graphs, Arrangements on parametric surfaces. I: General framework and infrastructure, Crossover can provably be useful in evolutionary computation, A simple certifying algorithm for 3-edge-connectivity, Recognizing optimal 1-planar graphs in linear time, A certifying algorithm for lattice point feasibility in a system of UTVPI constraints, Partitioning planar graphs: a fast combinatorial approach for max-cut, Global constraints for round robin tournament scheduling., Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture, Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox, Certifying algorithms, A general approach to the analysis of controlled perturbation algorithms, Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods, An Experimental Study on Generating Planar Graphs, Reducing rank-maximal to maximum weight matching, Tree decompositions of graphs: saving memory in dynamic programming, Improving the topology computation of an arrangement of cubics, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, Point-to-point and multi-goal path planning for industrial robots, Certifying 3-edge-connectivity, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Computing Large Planar Regions in Terrains, An exact algorithm for side-chain placement in protein design, Classroom examples of robustness problems in geometric computations, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, A cubic kernel for feedback vertex set and loop cutset, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, Structural filtering: a paradigm for efficient and exact geometric programs, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Minimum weight convex Steiner partitions, Efficient authenticated data structures for graph connectivity and geometric search problems, Sweep synchronization as a global propagation mechanism, On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection, Cardinal directions between spatial objects: the pairwise-consistency problem, Low-energy excitations in the three-dimensional random-field Ising model, An extended model and a column generation algorithm for the planar multicommodity flow problem, A graph library for Isabelle, Simple algorithms for partial point set pattern matching under rigid motion, On the design of CGAL a computational geometry algorithms library, Solving a gas-lift optimization problem by dynamic programming, Parallelization alternatives and their performance for the convex hull problem, An Improved Upward Planarity Testing Algorithm and Related Applications, Exact, efficient, and complete arrangement computation for cubic curves, Graph Simultaneous Embedding Tool, GraphSET, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Sorting and searching in faulty memories, Voronoi diagram for services neighboring a highway, Consistent digital curved rays and pseudoline arrangements, Empirical study of exact algorithms for the multi-objective spanning tree, A Lagrangian relaxation approach for the multiple sequence alignment problem, Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis., LEDA, Trustworthy Graph Algorithms (Invited Talk), A \(2/3\)-approximation algorithm for vertex-weighted matching, Building Mathematics-Based Software Systems to Advance Science and Create Knowledge, Multi-core Implementations of Geometric Algorithms, Of What Use Is Floating-Point Arithmetic in Computational Geometry?, Is the World Linear?, Much Ado about Zero, Computing large planar regions in terrains, with an application to fracture surfaces, Delaunay triangulation of imprecise points in linear time after preprocessing, Computational study on planar dominating set problem, Crossing minimization in weighted bipartite graphs, Linear-time certifying algorithms for near-graphical sequences, Computing the topology of an arrangement of implicitly defined real algebraic plane curves, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, Maintaining a topological order under edge insertions, Bid evaluation in procurement auctions with piecewise linear supply curves, An exact and efficient approach for computing a cell in an arrangement of quadrics, A decomposition-based approach to layered manufacturing, A framework for the verification of certifying computations