scientific article; zbMATH DE number 6776481

zbMath1375.52001MaRDI QIDQ5358292

No author found.

Publication date: 20 September 2017

Full work available at URL: https://www.taylorfrancis.com/books/9781498711425

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

Computational geometry Discrete geometry Handbook

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Finite geometry and special incidence structures (51Exx)

Related Items

Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ Maximum-area and maximum-perimeter rectangles in polygons ⋮ Hyperplane equipartitions plus constraints ⋮ Duality cascades and parallelotopes ⋮ Emotion recognition in talking-face videos using persistent entropy and neural networks ⋮ Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods ⋮ Guaranteed deterministic approach to superhedging: a numerical experiment ⋮ Finding a largest-area triangle in a terrain in near-linear time ⋮ An improved embedded discrete fracture model and domain connectivity algorithms on 3D unstructured grids ⋮ Nearest neighbor control for practical stabilization of passive nonlinear systems ⋮ Reconstruction of Weakly Simple Polygons from Their Edges ⋮ Constrained random matching ⋮ Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ On Voronoi’s conjecture for four- and five-dimensional parallelohedra ⋮ Tukey depth histograms ⋮ An efficient algorithm for the proximity connected two center problem ⋮ Geometric pattern matching reduces to \(k\)-SUM ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Minimizing visible edges in polyhedra ⋮ On the \(f\)-vectors of \(r\)-multichain subdivisions ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus ⋮ Shape-faithful graph drawings ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ triSurfaceImmersion: computing volume fractions and signed distances from triangulated surfaces immersed in unstructured meshes ⋮ Bier spheres of extremal volume and generalized permutohedra ⋮ Entropic Trust Region for Densest Crystallographic Symmetry Group Packings ⋮ Turning Grain Maps into Diagrams ⋮ Differentially private range query on shortest paths ⋮ Observation routes and external watchman routes ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Approximate range closest-pair queries ⋮ Trajectory planning for an articulated probe ⋮ Bundled crossings revisited ⋮ Optimal facility location problem on polyhedral terrains using descending paths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Voronoi Conjecture for Combinatorially Voronoi Parallelohedra in Dimension 5 ⋮ Solutions to the Minimum Variance Problem Using Delaunay Triangulation ⋮ Packing 13 circles in an equilateral triangle ⋮ Sparse convex hull coverage ⋮ Largest triangles in a polygon ⋮ Improved bounds for guarding plane graphs with edges ⋮ Algorithmic enumeration of surrounding polygons ⋮ Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment ⋮ Improved approximate Rips filtrations with shifted integer lattices and cubical complexes ⋮ Geometric Pattern Matching Reduces to k-SUM. ⋮ Unnamed Item ⋮ A new proof of Balinski's theorem on the connectivity of polytopes ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Ripser: efficient computation of Vietoris-Rips persistence barcodes ⋮ The first-order flexibility of a crystallographic framework ⋮ Using discrete Ricci curvatures to infer COVID-19 epidemic network fragility and systemic risk ⋮ Sphere packing and quantum gravity ⋮ Unavoidable complexes, via an elementary equivariant index theory ⋮ Ham-Sandwich Cuts and Center Transversals in Subspaces ⋮ Discrete Helly-type theorems for pseudohalfplanes ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ On the longest spanning tree with neighborhoods ⋮ Oriented area as a Morse function on polygon spaces ⋮ Local versus global distances for zigzag and multi-parameter persistence modules ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Self-polar polytopes ⋮ Prescribing symmetries and automorphisms for polytopes ⋮ On the restricted \(k\)-Steiner tree problem ⋮ Minimum weight disk triangulations and fillings ⋮ How to Keep an Eye on Small Things ⋮ Improved bounds for guarding plane graphs with edges ⋮ On the Edge-Length Ratio of 2-Trees ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time ⋮ Envy-free division in the presence of a dragon ⋮ Minimum number of partial triangulations ⋮ The Varchenko-Gel'fand ring of a cone ⋮ Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds

Uses Software