scientific article; zbMATH DE number 2107521
From MaRDI portal
zbMath1056.52001MaRDI QIDQ4821338
No author found.
Publication date: 13 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
BAR-CODES OF SIERPIŃSKI RELATIVES WITH TRIANGLE CONVEX HULLS, Equipartitions and Mahler volumes of symmetric convex bodies, Combining Voronoi Graph and Spline-Based Approaches for a Mobile Robot Path Planning, Robustness and Randomness, Peeling Potatoes Near-Optimally in Near-Linear Time, Kinetic Geodesic Voronoi Diagrams in a Simple Polygon, A novel approach for modeling order picking paths, CONVEX HULLS OF SIERPIŃSKI RELATIVES, 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, Molecular robots with chirality on grids, An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3, Molecular pattern formation on grids in the \textsc{Moblot} model, Lipschitz-free Spaces on Finite Metric Spaces, How fast can we play Tetris greedily with rectangular pieces?, Invariant inference with provable complexity from the monotone theory, Unnamed Item, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, A theorem and an algorithm involving Muirhead's inequality, One-sided terrain guarding and chordal graphs, An Interactive Tool to Explore and Improve the Ply Number of Drawings, Optimal Triangulation with Steiner Points, A consistent semantics of self-adjusting computation, On the Structure of Isometrically Embeddable Metric Spaces, Solution Reconstruction on Unstructured Tetrahedral Meshes UsingP1-Conservative Interpolation, Persistent homology for low-complexity models, A simple and efficient kinetic spanner, Circumspheres of sets of n + 1 random points in the d-dimensional Euclidean unit ball (1 ≤ n ≤ d), Approximating the volume of tropical polytopes is difficult, Some Discrete Properties of the Space of Line Transversals to Disjoint Balls, A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves, Approximating Largest Convex Hulls for Imprecise Points, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, Unnamed Item, Almost Simplicial Polytopes: The Lower and Upper Bound Theorems, Alexander r-tuples and bier complexes, Polygonal Complexes and Graphs for Crystallographic Groups, Efficient operations on discrete paths, Exact Minkowski sums of polygons with holes, Robust vertex enumeration for convex hulls in high dimensions, Distance-sensitive planar point location, Polytopes with few vertices and few facets, Advanced programming techniques applied to CGAL's arrangement package, Touring a sequence of disjoint polygons: complexity and extension, Finding Pairwise Intersections Inside a Query Range, Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?, Unnamed Item, Soft Subdivision Search in Motion Planning, II: Axiomatics, Large-field inflation with multiple axions and the weak gravity conjecture, An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures, Note on covering monotone orthogonal polygons with star-shaped polygons, Chattering in the reach control problem, On the robustness to multiple agent losses in 2D and 3D formations, Random sorting networks, Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope, An extension of Kemperman's characterization on \(k\)-independence and its application, Line-segment intersection made in-place, A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs, Discrete geometry on colored point sets in the plane -- a survey, The visibility-Voronoi complex and its applications, Helly numbers of polyominoes, The geodesic diameter of polygonal domains, The differential of probabilistic entailment, Approximating set multi-covers, Dynamics and limiting behavior of Julia sets of König's method for multiple roots, A parallel matrix-free conservative solution interpolation on unstructured tetrahedral meshes, $$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$, Subquadratic algorithms for algebraic 3SUM, A Euclidean Ramsey result in the plane, Polytopes close to being simple, Expected similarity estimation for large-scale batch and streaming anomaly detection, Polytopes with preassigned automorphism groups, Universality theorems for inscribed polytopes and Delaunay triangulations, An inequality on the edge lengths of triangular meshes, Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl, Scheduling problems, Complete and computable orbit invariants in the geometry of the affine group over the integers, A new interface tracking method: the polygonal area mapping method, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Improved Bounds for Wireless Localization, Colored ray configurations, Representation complexity of adaptive 3D distance fields, On the computation of zone and double zone diagrams, On the construction of highly symmetric tight frames and complex polytopes, On polynomial rings over nil rings in several variables and the central closure of prime nil rings, Conservative interpolation between volume meshes by local Galerkin projection, Dynamic and internal longest common substring, Indexability, concentration, and VC theory, Dynamically consistent updating of multiple prior beliefs -- an algorithmic approach, Compatible spanning trees, Minimum-link paths revisited, The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains, Sweeping Points, Illumination complexes, \(\varDelta\)-zonotopes, and the polyhedral curtain theorem, Spiderman graph: visibility in urban regions, Encompassing colored planar straight line graphs, Matroid enumeration for incidence geometry, Signed difference analysis: testing for structure under monotonicity, Algorithms for finding connected separators between antipodal points, A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing, Multiple chessboard complexes and the colored Tverberg problem, Real-valued embeddings and sketches for fast distance and similarity estimation, Quantitative bi-Lipschitz embeddings of bounded-curvature manifolds and orbifolds, Flips in planar graphs, An Experimental Study of Weighted k-Link Shortest Path Algorithms, Tractability conditions for numeric CSPs, Periods of Ehrhart coefficients of rational polytopes, Finding pairwise intersections inside a query range, Data imprecision under \(\lambda\)-geometry model, A note on the fibres of Mori fibre spaces, Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram, Chessboard complexes indomitable, Efficient on-line algorithms for Euler diagram region computation, Covering a simple polygon by monotone directions, Computational topology of equivariant maps from spheres to complements of arrangements, Green matrices associated with generalized linear polyominoes, Flag complexes and homology, Approximating largest convex hulls for imprecise points, Rectangular tileability and complementary tileability are undecidable, \(G^1\)-interpolation and geometry reconstruction for higher order finite elements, Double-normal pairs in the plane and on the sphere, Improvement on asymptotic density of packing families derived from multiplicative lattices, An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions, Rotationally monotone polygons, Planar linkages following a prescribed motion, Tropicalization and irreducibility of generalized Vandermonde determinants, Extension Complexity of Polytopes with Few Vertices or Facets, An efficient algorithm for the stratification and triangulation of an algebraic surface, Compact and succinct data structures for multidimensional orthogonal range searching, WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences, Invariants of multidimensional time series based on their iterated-integral signature, Counterexamples to the uniformity conjecture, A characterization theorem and an algorithm for a convex hull problem, A new mathematical model for tiling finite regions of the plane with polyominoes, Implicit self-adjusting computation for purely functional programs, On soft predicates in subdivision motion planning, Topological data analysis for the energy and stability of endohedral metallofullerenes
Uses Software
