scientific article; zbMATH DE number 1424293
From MaRDI portal
zbMath0995.65024MaRDI QIDQ4945505
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
optimizationalgorithmsmotion planningDelaunay triangulationVoronoi diagramspower diagramsdivide and conquergeometric clusteringdistance problems
Related Items
Abstract Voronoi diagram in 3-space, An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments, A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\), Abstract Voronoi diagrams revisited, A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\), Algebro-geometric analysis of bisectors of two algebraic plane curves, Efficient Time Integration of Maxwell's Equations with Generalized Finite Differences, The Offset Filtration of Convex Objects, Farthest line segment Voronoi diagrams, Aspect-ratio Voronoi diagram and its complexity bounds, Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space, The finite cell method for polygonal meshes: poly-FCM, Optimally solving a transportation problem using Voronoi diagrams, On topological changes in the Delaunay triangulation of moving points, An approximation algorithm for computing shortest paths in weighted 3-d domains, Generalized wave propagation problems and discrete exterior calculus, Mechanical properties of open cell foams: Simulations by Laguerre tesselation procedure, Computation of the metric average of 2D sets with piecewise linear boundaries, The visibility-Voronoi complex and its applications, Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space, Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints, Nearest-neighbor searching under uncertainty. I, Reprint of: Optimally solving a transportation problem using Voronoi diagrams, Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks, On soft power diagrams, Electoral competition in 2-dimensional ideology space with unidimensional commitment, Solving some vector subset problems by Voronoi diagrams, A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\), An LP-based \(k\)-means algorithm for balancing weighted point sets, Arrangements on parametric surfaces. II: Concretizations and applications, Watchman tours for polygons with holes, Distributed communication-aware coverage control by mobile sensor networks, Rigid ball-polyhedra in Euclidean 3-space, Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore, Approximating generalized distance functions on weighted triangulated surfaces with applications, Farthest-polygon Voronoi diagrams, Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D, On the computation of zone and double zone diagrams, Weak equilibrium in a spatial model, Bounded representation and radial projections of bisectors in normed spaces, Decentralized swarm coordination: a combined coverage/connectivity approach, The weighted farthest color Voronoi diagram on trees and graphs., Comparative concepts, Energy-aware planning of motion and communication strategies for networked mobile robots, Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities, Interpretation and optimization of the \(k\)-means algorithm., Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location, Union of random Minkowski sums and network vulnerability analysis, Joint co-clustering: Co-clustering of genomic and clinical bioimaging data, Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction, Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes, On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces, Geometric clustering for the consolidation of farmland and woodland, Tree-like decompositions of simply connected domains, Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game, Connecting Red Cells in a Bicolour Voronoi Diagram, Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography, A discrete Laplace-Beltrami operator for simplicial surfaces, A monotonicity property for weighted Delaunay triangulations, Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments, Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract], Constrained \(k\)-center and movement to independence, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D, Effective conductive properties of open-cell foams, Witness (Delaunay) graphs, On the estimation of the medial axis and inner parallel body, On shape Delaunay tessellations, Convex equipartitions via equivariant obstruction theory, Classification of multivariate time series and structured data using constructive induction, Higher-order Voronoi diagrams on triangulated surfaces, 2-Covered paths by a set of antennas with minimum power transmission range, Maximum Neighbour Voronoi Games, On Kinetic Delaunay Triangulations, Extension of efficient, swept‐integration‐based conservative remapping method for meshes with changing connectivity, Computing generalized higher-order Voronoi diagrams on triangulated surfaces, Finding an Euclidean anti-\(k\)-centrum location of a set of points, Voronoi diagram for services neighboring a highway, Emergence of density dynamics by surface interpolation in elementary cellular automata, Bivariate density estimation using BV regularisation, The adaptive Delaunay tessellation: A neighborhood covering meshing technique, The Voronoi diagram of three lines, Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams, Computing the topology of Voronoï diagrams of parallel half-lines, Searching for equilibrium positions in a game of political competition with restrictions, Facility location problems in the plane based on reverse nearest neighbor queries, On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane, The transportation metric and related problems, On regular 4-coverings and their application for lattice coverings in normed planes, A multi-class large margin classifier, Robustness of \(k\)-gon Voronoi diagram construction, Fundamental Domains for Symmetric Optimization: Construction and Search, The geometry of Minkowski spaces -- a survey. II., Combinatorial Calabi flow with surgery on surfaces, A lower bound on Voronoi diagram complexity., The \(k\)-nearest-neighbor Voronoi diagram revisited, Self-regularized causal structure discovery for trajectory-based networks, Optimal algorithms for complete linkage clustering in \(d\) dimensions, Edge flips in surface meshes, On the complexity of higher order abstract Voronoi diagrams, Prescribing discrete Gaussian curvature on polyhedral surfaces, The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\), On bisectors for different distance functions, Sequences of spanning trees and a fixed tree theorem, Bregman Voronoi diagrams, Conformal mapping in linear time
