Publication:4702188
From MaRDI portal
zbMath0976.68156MaRDI QIDQ4702188
Publication date: 24 November 1999
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, 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, On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation, The point of polygon problem for arbitrary polygons, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Polygon decomposition for efficient construction of Minkowski sums, LEDA, Programming with C++ concepts, ISB-tree: A new indexing scheme with efficient expected behaviour, Shortest path and maximum flow problems in networks with additive losses and gains, Arrangements on parametric surfaces. I: General framework and infrastructure, Cardinal directions between spatial objects: the pairwise-consistency problem, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Trading uninitialized space for time, Creating a consensus ranking of proposals from reviewers' partial ordinal rankings, The infection time of graphs, Experiments on data reduction for optimal domination in networks, A polynomial algorithm for the multicriteria cent-dian location problem, An intersection-sensitive algorithm for snap rounding, Improving the topology computation of an arrangement of cubics, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, A cubic kernel for feedback vertex set and loop cutset, Low-energy excitations in the three-dimensional random-field Ising model, Sorting and searching in faulty memories, Voronoi diagram for services neighboring a highway, A Lagrangian relaxation approach for the multiple sequence alignment problem, 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, Short trees in polygons, Global constraints for round robin tournament scheduling., Spin glasses: a computational challenge for the 21st century, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Metabolic isotopomer labeling systems. II: Structural flux identifiability analysis., Computing large planar regions in terrains, with an application to fracture surfaces, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, Maintaining a topological order under edge insertions, A decomposition-based approach to layered manufacturing, 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, Balancing sparse Hamiltonian eigenproblems, 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, Computing all efficient solutions of the biobjective minimum spanning tree problem, A separation bound for real algebraic expressions, Reducing rank-maximal to maximum weight matching, Tree decompositions of graphs: saving memory in dynamic programming, Classroom examples of robustness problems in geometric computations, Structural filtering: a paradigm for efficient and exact geometric programs, Sweep synchronization as a global propagation mechanism, On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection, Simple algorithms for partial point set pattern matching under rigid motion, Solving a gas-lift optimization problem by dynamic programming, Parallelization alternatives and their performance for the convex hull problem, Exact, efficient, and complete arrangement computation for cubic curves, Bid evaluation in procurement auctions with piecewise linear supply curves, An exact and efficient approach for computing a cell in an arrangement of quadrics, Attributed relational graph matching based on the nested assignment structure, Point-to-point and multi-goal path planning for industrial robots, A Linear Kernel for Planar Feedback Vertex Set, An extended model and a column generation algorithm for the planar multicommodity flow problem, An Improved Upward Planarity Testing Algorithm and Related Applications, Graph Simultaneous Embedding Tool, GraphSET, 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
