Concrete and abstract Voronoi diagrams
From MaRDI portal
Publication:1188589
DOI10.1007/3-540-52055-4zbMath0699.68005OpenAlexW4210881201MaRDI QIDQ1188589
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52055-4
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (92)
Abstract Voronoi diagram in 3-space ⋮ ``The big sweep: On the power of the wavefront approach to Voronoi diagrams ⋮ An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments ⋮ Coverage control of mobile sensor networks with directional sensing ⋮ On non-smooth convex distance functions ⋮ Abstract Voronoi diagrams revisited ⋮ Fuzzy skeleton by influence zones -- application to interpolation between fuzzy sets ⋮ Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples ⋮ 3D meso-structural analysis of concrete specimens under uniaxial tension ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ A compact piecewise-linear Voronoi diagram for convex sites in the plane ⋮ Randomized incremental construction of simple abstract Voronoi diagrams in 3-space ⋮ On Delaunay oriented matroids for convex distance functions ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ Fast Voronoi modeling ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ “The big sweep”: On the power of the wavefront approach to Voronoi diagrams ⋮ Voronoi diagrams for polygon-offset distance functions ⋮ Deletion in abstract Voronoi diagrams in expected linear time and related problems ⋮ Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations ⋮ An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs ⋮ Coloring points with respect to squares ⋮ Incremental Voronoi diagrams ⋮ OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS ⋮ Unnamed Item ⋮ Sensitivity analysis and tailored design of minimization diagrams ⋮ Straight skeletons for general polygonal figures in the plane ⋮ Casting a polyhedron with directional uncertainty ⋮ Forest-like abstract Voronoi diagrams in linear time ⋮ On the uniqueness of isosceles orthogonality in normed linear spaces ⋮ Modified refinement algorithm to construct Lyapunov functions using meshless collocation ⋮ Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ THE HEAVY LUGGAGE METRIC ⋮ Starshaped sets ⋮ PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING ⋮ Computing the map of geometric minimal cuts ⋮ Bottleneck detour tree of points on a path ⋮ Searching for segments with largest relative overlap ⋮ Stabbing circles for sets of segments in the plane ⋮ THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH ⋮ Coloring Delaunay-edges and their generalizations ⋮ Characterization of contour elements that generate abstract Voronoi diagrams ⋮ Unnamed Item ⋮ Solving continuous location-districting problems with Voronoi diagrams ⋮ Virtual elements and zero thickness interface-based approach for fracture analysis of heterogeneous materials ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS ⋮ Randomized incremental construction of abstract Voronoi diagrams ⋮ Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ Static competitive facility location: an overview of optimisation approaches. ⋮ A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions ⋮ THE FORMATION OF VORONOI DIAGRAMS IN CHEMICAL AND PHYSICAL SYSTEMS: EXPERIMENTAL FINDINGS AND THEORETICAL MODELS ⋮ Voronoi diagrams for convex polygon-offset distance functions ⋮ ON MULTITASKING IN PARALLEL CHEMICAL PROCESSORS: EXPERIMENTAL FINDINGS ⋮ Unnamed Item ⋮ Divide-and-conquer for Voronoi diagrams revisited ⋮ Randomized incremental construction of simple abstract Voronoi diagrams in 3-space ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Bregman Voronoi diagrams ⋮ Maximum spanning trees in normed planes ⋮ Dynamic construction of abstract Voronoi diagrams ⋮ Voronoi diagram for services neighboring a highway ⋮ Convex polygons are self-coverable ⋮ A fast algorithm for data collection along a fixed track ⋮ VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE ⋮ OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM ⋮ The role of nonlinearity in computing graph-theoretical properties of resting-state functional magnetic resonance imaging brain networks ⋮ The geodesic farthest-point Voronoi diagram in a simple polygon ⋮ On the construction of abstract Voronoi diagrams ⋮ THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS ⋮ Computing the topology of Voronoï diagrams of parallel half-lines ⋮ An analysis of pitch-class segmentation in John Cage'sRyoanji for oboeusing morphological image analysis and formal concept analysis ⋮ Proper coloring of geometric hypergraphs ⋮ MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs ⋮ Robustness of \(k\)-gon Voronoi diagram construction ⋮ Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams ⋮ Deletion in Abstract Voronoi Diagrams in Expected Linear Time. ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ Abstract Voronoi Diagrams from Closed Bisecting Curves ⋮ Grid generation and optimization based on centroidal Voronoi tessellations ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions ⋮ Strong thinning and polyhedric approximation of the surface of a voxel object ⋮ Voronoi diagrams on the sphere ⋮ On some limitations of reaction-diffusion chemical computers in relation to Voronoi diagram and its inversion ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended ⋮ On the complexity of higher order abstract Voronoi diagrams ⋮ Grid refinement in the construction of Lyapunov functions using radial basis functions ⋮ Optimal partitioning for spatiotemporal coverage in a drift field
This page was built for publication: Concrete and abstract Voronoi diagrams
