Voronoi diagrams in higher dimensions under certain polyhedral distance functions

From MaRDI portal
Publication:1389168

DOI10.1007/PL00009366zbMath0897.68113OpenAlexW1971622590MaRDI QIDQ1389168

B. Tagansky, Jean-Daniel Boissonnat, Mariette Yvinec, Micha Sharir

Publication date: 11 June 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009366




Related Items (37)

Abstract Voronoi diagram in 3-spaceOn non-smooth convex distance functionsVoronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurationsArrangements in higher dimensions: Voronoi diagrams, motion planning, and other applicationsOn the representation of the search region in multi-objective optimization(Approximate) uncertain skylinesApproximately dominating representativesChallenges of continuous global optimization in molecular structure predictionThe impact of heterogeneity and geometry on the proof complexity of random satisfiabilityAn improved algorithm for Klee's measure problem on fat boxesVoronoi diagrams of algebraic varieties under polyhedral normsOn the union of cylinders in three dimensionsFaster algorithms for largest empty rectangles and boxesAsymmetric tropical distances and power diagramsKinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functionsUnions of fat convex polytopes have short skeletonsEmpty squares in arbitrary orientation among pointsOn the number of views of translates of a cube and related problems.Union of Hypercubes and 3D Minkowski Sums with Random Sizes.On the Computational Complexity of Linear DiscrepancyVoronoi polytopes for polyhedral norms on latticesEfficient computation of the search region in multi-objective optimizationParallel Delaunay triangulation in three dimensionsEctropy of diversity measures for populations in Euclidean spaceDensity based fuzzy \(c\)-means clustering of non-convex patternsInterpolation of Lipschitz functionsUnion of hypercubes and 3D Minkowski sums with random sizesMaximal Empty Boxes Amidst Random PointsComputing a minimum-width cubic and hypercubic shellClustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation MatricesA new technique for analyzing substructures in arrangements of piecewise linear surfacesPersistent homology in \(\ell_\infty\) metricGeometry and combinatorics of the cutting angle methodA (slightly) faster algorithm for Klee's measure problemThe geometry of Minkowski spaces -- a survey. II.A lower bound on Voronoi diagram complexity.Unnamed Item




This page was built for publication: Voronoi diagrams in higher dimensions under certain polyhedral distance functions